We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 5491e83 commit 032cd0eCopy full SHA for 032cd0e
18 - Binary Search Tree Data Structure Problems/05 - Check for BST/main.cpp
@@ -0,0 +1,20 @@
1
+class Solution {
2
+ public:
3
+ bool isBST(Node* root, Node* & prev){
4
+ if(root == NULL) return true;
5
+
6
+ if(!isBST(root -> left, prev)) return false;
7
8
+ if(prev != NULL && root -> data <= prev -> data) return false;
9
10
+ prev = root;
11
12
+ return isBST(root -> right, prev);
13
14
+ }
15
16
+ bool isBST(Node* root) {
17
+ Node* prev = NULL;
18
+ return isBST(root, prev);
19
20
+};
0 commit comments