README ¶ < Previous Next > 255. Verify Preorder Sequence in Binary Search Tree (Medium) 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. Consider the following binary search tree: 5 / \ 2 6 / \ 1 3 Example 1: Input: [5,2,6,1,3] Output: false Example 2: Input: [5,2,1,3,6] Output: true Follow up: Could you do it using only constant space complexity? Related Topics [Stack] [Tree] Similar Questions Binary Tree Preorder Traversal (Medium) Expand ▾ Collapse ▴ Documentation ¶ There is no documentation for this package. Source Files ¶ View all Source files verify_preorder_sequence_in_binary_search_tree.go Click to show internal directories. Click to hide internal directories.