-
Notifications
You must be signed in to change notification settings - Fork 28
/
Verify_Preorder_Sequence_in_Binary_Search_Tree.cpp
65 lines (57 loc) · 1.92 KB
/
Verify_Preorder_Sequence_in_Binary_Search_Tree.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
class Solution {
bool verifyPreorder(int left, int right, vector<int> const& preorder) {
if(left >= right) { return true; }
int root = preorder[left];
int leftIndx = left + 1, rightIndx = right + 1;
for(int k = left + 1; k <= right; ++k) {
if(preorder[k] > root) {
rightIndx = k;
break;
}
}
for(int k = rightIndx; k <= right; ++k) {
if(preorder[k] < root) {
return false;
}
}
return verifyPreorder(left + 1, rightIndx - 1, preorder) and verifyPreorder(rightIndx, right, preorder);
}
public:
bool verifyPreorder(vector<int>& preorder) {
if(preorder.empty()) return true;
// TLE
// return verifyPreorder(0, (int)preorder.size() - 1, preorder);
// O(n) stack based solution
/*
int Min = INT_MIN;
int n = (int)preorder.size();
stack<int> stk;
stk.push(preorder[0]);
for(int i = 1; i < n; ++i) {
if(preorder[i] < Min) return false;
while(!stk.empty() and preorder[i] > stk.top()) {
Min = stk.top();
stk.pop();
}
stk.push(preorder[i]);
}
return true;
*/
int Min = INT_MIN;
int n = (int)preorder.size();
int i = 0, minIndx = -1;
for(i = 1; i < n and preorder[i] > Min; ++i) {
if(preorder[i] > preorder[i - 1]) { // we entered in right branch
int k = i - 1;
for(int j = i - 2; j > minIndx; --j) {
if(preorder[j] < preorder[i] and preorder[j] > preorder[k]) {
k = j;
}
}
minIndx = k;
Min = preorder[k];
}
}
return (i >= n);
}
};