CodeMosa
Master LeetCode Patterns
All Patterns
Collections
Sign In
Back
Binary Search Tree
Question 1 of 12
8% Complete
Medium
What's a robust way to validate a BST?
A
DFS with min/max bounds propagated down
B
Check local property node.left < node < node.right only
C
Sort inorder list and compare
D
Random sampling of nodes