Tree Algorithms
Casual Mode - Take your time!
1 / 15
Correct
0
Incorrect
0
Score
0%
Multiple Choice
Which of the following is a fundamental property of a binary search tree (BST)?
- Each node has a maximum of two children.
- The left child is always smaller than the parent node.
- The right child is always larger than the parent node.
- All of the above.