KwickClips Java · 41 sec · free
In a binary search tree, which side holds smaller values?
Short answer. The left subtree.
Why is searching a BST fast?
Each comparison lets you ignore one whole subtree.
Search 40
| At node | Compare | Go |
|---|---|---|
| 50 | 40 < 50 | left |
| 30 | 40 > 30 | right |
| 40 | equal | found |
Remember
| Smaller: left, bigger: right |
| In order gives sorted order |
How can a tree find a number so fast? In a binary search tree, smaller goes left. Forty is less than fifty, so left. More than thirty, so right. Found. Remember. Smaller left, bigger right. In order gives sorted order.
This clip is from the full lesson: Binary Trees and Tree Traversals — 8 minutes, with the tables, the quick answers and the whole lesson in text.
Useful for: ISC Class 12 Computer Science (868), ISC Class 12 Computer Science (868), Programming All levels Java
More KwickClips from this lesson
What is the degree of a node?43 sec
Which traversal prints the root last?43 sec
Which nodes are the leaves here?43 secVoice-over is AI-generated; the script is written and checked by Kajal Ma'am. Confirm anything you plan around against your official board document. We never ask for a password or an OTP.