Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 456
How can you check if a binary tree is a valid BST?
A
Check each node only against its children
B
Recurse with (low, high) bounds, or check that an in-order traversal is strictly increasing
C
Check that leaves are sorted
D
Check that it's balanced