Algorithms
A binary tree is written in level order (as in LeetCode): the root first, then the children of each node left to right, with null for a missing child. Missing children of null entries are not listed. A tree is a valid binary search tree (BST) if, for every node, all values in its left subtree are strictly less than the node's value and all values in its right subtree are strictly greater.
Which of the following trees is a valid BST?
Discussion (0)