Trees & Heaps
Tree Fundamentals
- Tree Data Structure - Tree concepts and terminology
- Binary Tree - Basic binary tree structure
- Binary Search Tree - BST operations and properties
Balanced Trees
- AVL Tree - Self-balancing BST
- 2-3 Search Trees - Multi-way search trees
- Left Leaning Red-Black BSTs (LLRB) - Balanced BST variant
- B-Tree - Multi-way tree for databases
Heaps
- Binary Heap - Complete binary tree heap
- k-ary / d-ary / d-way Heap - Generalized heaps
- Binomial Heap - Collection of binomial trees
- Fibonacci Heap - Lazy consolidation heap
- Beap (Bi-Parental Heap) - Hybrid heap structure
Specialized Trees
- Segment Tree - Range query tree
- Interval Search Tree - Overlapping intervals
- Space-partitioning Trees - Spatial data structures
- Kd-trees - k-dimensional binary search trees
Practice
- Problems - Tree and heap practice problems