leetcode/problems/verify-preorder-sequence-in-binary-search-tree at main · awesee/leetcode

Name		Name	Last commit message	Last commit date
parent directory ..
README.md		README.md
verify_preorder_sequence_in_binary_search_tree.go		verify_preorder_sequence_in_binary_search_tree.go
verify_preorder_sequence_in_binary_search_tree_test.go		verify_preorder_sequence_in_binary_search_tree_test.go

README.md

< Previous 　　　　　　　　　　　　　　　　 Next >

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:

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?