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?
If you have different approach in mind or have any suggestion for this implementation feel free to share in the comment below. Thanks!