##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
What you learned
BST property: left < node < right for all nodes. Operations: Search, insert, delete all where is height. Inorder traversal gives sorted order. Key Patterns: - Validate by passing min/max bounds - Successor: leftmost in right subtree - Balance matters: worst case Problems: Validate BST, kth smallest, LCA, recover BST.
Time: . Space: .
