where each node has at most two children — is the foundation of binary search trees (BSTs), which provide O(log n) search, insert, and delete.