A binary tree in which every node's left subtree contains only values less than the node, and every node's right subtree contains only values greater than the node. This property allows O(log n) search, insertion, and deletion on average. (Ch. 24)