Validate Binary Search Tree LeetCode 98. Validate Binary Search Tree Solutions Solution 1: Keep lower bound and upper bound for each node Recursively check if a node is within the range Solution 2: Inorder Traversal PREVIOUSUninformed SearchNEXTAdversarial Search