Recursion & Trees

Thinking Recursively

Recursive Functions

Binary Trees

Tree Traversal

Binary Search Trees

BST Operations: Search, Insert, Delete

Balanced Binary Search Trees

Heaps and Priority Queues

AVL Trees and Red-Black Trees

Tree Dynamic Programming

Tries (Prefix Trees)

N-ary Trees and General Tree Operations

Memoization and Dynamic Programming

Backtracking Algorithms

Lowest Common Ancestor (LCA) Algorithms

Segment Trees and Fenwick Trees (BITs)

Disjoint Set Union (Union-Find Data Structure)

Suffix Trees and Suffix Arrays

Iterative Tree Traversal Techniques (e.g., Morris Traversal)

KD-Trees and Quadtrees for Spatial Indexing