Given an array of numbers, verify whether it is the correct preorder traversal sequence of a binary search tree.
You may assume each number in the sequence is unique.
Follow up:
Could you do it using only constant space complexity?
public class Solution {
public boolean verifyPreorder(int[] preorder) {
int low = Integer.MIN_VALUE;
Stack<Integer> stack = new Stack<Integer>();
for (int val: preorder) {
if (val < low) {
return false;
}
while (!stack.isEmpty() && val > stack.peek()) {
low = stack.pop();
}
stack.push(val);
}
return true;
}
}