Binary search trees
Computer Science · Data structures
Loading practice question…
About this practice set
Binary search trees is part of Computer Science (Data structures). Questions are generated with new numbers each time you practise. Levels available: Easy. After you answer, an explanation is shown.
Example questions
A taste of what you will practise. Answers are revealed after you try.
Easy
In a binary search tree, a node’s left child is:
- Smaller than the node
- Larger than the node
- Equal
- Any value