BST

Definitions

1. Short for binary search tree, a tree structure where values are arranged so that smaller keys are found on one side and larger keys on the other. BSTs support ordered search and traversal efficiently when reasonably balanced, but degrade badly if they become too skewed.

   In plain English: A shorthand for binary search tree, a data structure for storing ordered values.

   Example: "The interview solution used a BST because range queries and sorted iteration were part of the requirements."

Related Terms

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