ordered binary tree
nounA tree-shaped way to store things where each thing is placed in a special order so you can find it quickly.
The program uses an ordered binary tree to keep the names sorted alphabetically.
RELATED WORDS
OTHER MEANINGS
2. A binary tree in which every node's left subtree holds smaller values and its right subtree holds larger values.
Inserting 5, 3, and 8 into an ordered binary tree puts 3 on the left and 8 on the right of 5.
3. A tree structure where the children of each node are arranged in a fixed left-to-right order.
Even without value comparisons, an ordered binary tree keeps track of which child is first and which is second.
4. A hierarchical index used in databases to speed up range queries.
The database engine built an ordered binary tree on the timestamp column to make date-range searches fast.