Chapter 2 References
Chapter 2 References
The sources below support the topics in Chapter 2. The chapter pages explain tree operations, invariants, and tradeoffs; this page collects the shared books and websites used to verify them.
Books
| Source | Topics |
|---|---|
| Introduction to Algorithms | Balanced search trees, heaps, B-trees, range queries, union-find, tries, suffix structures, and parsing |
| Algorithms, 4th Edition | Priority queues, interval indexes, tries, suffix arrays, spatial indexes, and complexity analysis |
| The Algorithm Design Manual | Tree selection, storage-engine indexes, parser design, and practical tradeoffs |
| Grokking Algorithms | Intuitive introductions to trees, hashing, and recursive data structures |
Websites
| Source | Topics |
|---|---|
| GeeksforGeeks | AVL and red-black trees, Fibonacci heaps, B+ and LSM trees, segment and interval trees, union-find, string matching, spatial indexes, ASTs, and symbol tables |
| Algorithms, 4th Edition Resources | Reference implementations and analysis exercises |