Binary Search Tree
noun
say it: “BY-nuh-ree SURCH TREE” /ˈbaɪnəri sɝtʃ triː/
A binary tree where every node's left side holds smaller values and its right side bigger ones, so searching goes one way at each node.
What is a binary search tree?
A binary search tree keeps smaller values to the left of every node and bigger ones to the right. A search compares and goes one way at each node, skipping the other side, like guessing a number by halves. When the tree is balanced, search, add and remove are O(log n).
In a sentence
- “Finding Kai in the binary search tree took three checks: left at Maya, right at Diego.”
Level: Journeyman · More Data Structures terms at this level
Updated