Chapter 2: Hierarchical Data Structures, Search Trees & Spatial Indexing

Tree-structured data: binary search trees, heaps, storage-engine trees, range-query trees, union-find, tries, and spatial indexing.

• Binary Search Trees & Self-Balancing Trees (AVL, Red-Black Trees)
• Heaps, Priority Queues, and Fibonacci Heaps
• Storage Engine Trees: B-Trees, B+ Trees, and Log-Structured Merge-Trees (LSM-Trees)
• Range Queries: Segment Trees, Fenwick Trees (Binary Indexed Trees), and Interval Trees
• Disjoint-Set Data Structures (Union-Find with Path Compression)
• Tries, Radix Trees, Suffix Trees/Arrays, and Advanced String Matching (KMP, Rabin-Karp, Aho-Corasick)
• Spatial Indexing & Geospatial Data Structures: Quadtrees, R-Trees, KD-Trees, and Geohashing
• Language Parsing Data Structures: Abstract Syntax Trees (AST), Parse Trees, and Symbol Tables
• Chapter 2 References