gen-explain-a-binary-search-tree-as-you-would-to-a-capable-stude-7efb

Explain a binary search tree as you would to a capable student, in 3-4 sentences.

A binary search tree (BST) is a data structure where each node has at most two children (left and right), organized by a simple rule: all values in the left subtree are smaller than the node's value, and all values in the right subtree are larger. This ordering makes searching very efficient—you can find any value by repeatedly comparing it to the current node and moving left or right, eliminating half the remaining possibilities at each step. For example, to find 7 in a BST, you'd start at the root and go right if 7 is larger or left if it's smaller, repeating until you find it or hit a dead end. This gives you O(log n) search time in a balanced tree, much faster than checking every element in an unsorted list.