Search Tree

Definitions

1. A tree data structure in which nodes are organized so that a comparison at each node directs the search toward a subtree, enabling O(log n) lookup in balanced variants such as binary search trees (BST), AVL trees, red-black trees, and B-trees.

   In plain English: A data structure shaped like a branching tree where each fork narrows down where to look, making searches very fast.

   Example: "We switched from a hash map to a balanced search tree because we need range queries, not just point lookups."

Related Terms

• Hash Map
• Hash Ring
• Hash Set
• Hashing Algorithm
• LIFO
• Linked List
• Priority Queue
• Segment Tree
• Skiplist
• Union Find
• Balanced Tree