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