Algorithms and Data Structures · Junior · Question 49 of 75
What property does a binary search tree (BST) have?
- 1Values always increase from the root down to the leaves
- ✓Correct answer: Left subtree values are smaller than the node, right ones are larger
- 3Every node has exactly two children, except the leaves
Explanation
This ordering lets a search go left or right at each node and skip half of the remaining tree when it's balanced. "Values increase toward the leaves" describes a heap, not a BST.