Binary Search Tree (BST) Topics

Master essential BST problems and patterns frequently asked in interviews.

•   01 Insert & Search in BST Basic operations: insert nodes, search values recursively & iteratively
•   02 Validate BST Check if a binary tree satisfies BST properties
•   03 Kth Smallest / Largest Element Use in-order traversal or augmented BST to find kth element
•   04 Lowest Common Ancestor in BST Leverage BST properties to find LCA efficiently
•   05 Range Sum in BST Compute sum of nodes within a given range using BST traversal

WONDERING, HOW DOES IT COVER PATTERNS?
These problems cover the most important BST patterns for interviews:

Insert & Search in BST → Recursive & iterative traversal for basic BST operations.
Validate BST → DFS traversal with min/max constraints to validate BST property.
Kth Smallest / Largest Element → In-order traversal, augmented data structures, or iterative stacks.
Lowest Common Ancestor in BST → Use BST ordering to navigate directly to LCA efficiently.
Range Sum in BST → DFS traversal with pruning using BST properties for efficiency.

Together, they ensure you understand basic operations, validation, kth element retrieval, ancestor queries, and range-based queries in BST problems.