A Binary Search Tree maintains a simple invariant: for every node with value : - All values in the left subtree are less than - All values in the right subtree are greater than Note: this applies to entire subtrees, not just immediate children.
If node 10 has left child 5, then 5's entire subtree must contain only values less than 10. This property enables binary search. To find value :
Compare with current node's value
If equal, found it
If is smaller, search left subtree
If is larger, search right subtree Each comparison eliminates half the remaining tree (in the balanced case).