Binary Search Tree
In plain terms
A binary tree keeping smaller values left and larger right.
Going deeper
A BST orders nodes so left subtrees hold smaller keys and right subtrees larger, enabling fast search, insert, and delete. Balance determines its efficiency.
Under the hood
Operations are O(log n) when balanced but degrade to O(n) if it becomes a linked-list shape, motivating self-balancing variants.
Examples
Ordered maps/sets, range queries, database indexes, autocomplete trees.
Think of it like...
Like a well-organized library where you always know which half to search next.