sorted binary tree
nounUK /ˈsɔːtɪd ˈbaɪnəri triː/
US /ˈsɔːrtɪd ˈbaɪnəri triː/
A sorted binary tree is a tree-shaped way to store numbers so you can find them quickly.
The program used a sorted binary tree to look up each name in a flash.
RELATED WORDS
OTHER MEANINGS
2. A data structure where each node has at most two children, with left values smaller and right values larger than the parent.
Inserting 5, 3, and 8 into a sorted binary tree keeps 3 on the left and 8 on the right.
3. A tree kept in order so that searching, adding, and removing items stay fast.
A balanced sorted binary tree keeps lookups fast even with millions of items.
4. A teaching example for recursion, since each subtree is itself a sorted binary tree.
The teacher used a sorted binary tree to explain how recursion works.