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 secDisclaimer. KwickAcademy is free study material for general learning and revision. Parts of it, including the voice-over, are produced with the help of AI tools and may contain errors; if you spot one, please tell us and we will correct it. Syllabus, marks and exam details follow the latest official board publications available to us, and boards can change them at any time, so always confirm against your board's official website and your school. Using this material does not guarantee any marks or result. Board names and trademarks belong to their owners; Kwickprep is not affiliated with or endorsed by any examination board. We never ask for passwords, OTPs or ID numbers. Your progress is saved only in this browser. Full disclaimer · Privacy