Binary Search Tree

Definitions

1. A tree structure in which each node's left subtree contains smaller keys and the right subtree contains larger keys, enabling ordered search operations. Binary search trees are conceptually simple, but performance depends heavily on how well balanced the tree remains over time.

   In plain English: A tree data structure that keeps smaller values on one side and larger values on the other for ordered searching.

   Example: "The in-memory index used a binary search tree because the workload required ordered range queries and insertions between existing keys."

Related Terms

• Binary Tree
• Hash Map
• LIFO
• Linked List
• Search Algorithm
• Sorted Set
• Subtree
• Tree
• Balanced Tree
• Bit Field
• BST
• Bucket Sort
• Connected Component