cannot solve it.
use the property of BST and preorder, which is the first element is the root of the tree, we can break it into 2 part, and the upper bound of left part is root, so as the lower bound of right part.
Or, use the BST property, use stack to store it, when meet smaller number, push it, when meet bigger number, it means we reach the right subtree, so we can set our lower bound to current stack