255. Verify Preorder Sequence in Binary Search Tree

• 255. Verify Preorder Sequence in Binary Search Tree
  • Description
  • Intuition
  • Pitfall
  • Solution
  • Reference

Description

Here

Intuition

Pitfall

有一种intuition是去verify的subarray[start ...end]是否存在一个div index, 所有[start + 1, div]都小于subarray[start]， 且[div, end]都大于subarray[start]

Solution

Reference

Java O(n) and O(1) extra space-and-O(1)-extra-space)