| Accounting Method: Credits Stored on Operations | concept | 1 | Open |
| Advanced Data Structures: Reading Guide | other | 3 | Open |
| Aggregate Method and the Dynamic Array | concept | 1 | Open |
| Applications: Kruskal MST, Dynamic Connectivity, Equivalence Classes | concept | 2 | Open |
| AVL Trees and the Height-Balanced Alternative | concept | 2 | Open |
| Binary Search Trees and the BST Property | concept | 1 | Open |
| Binomial Heaps: Structure and Merge | concept | 1 | Open |
| Bloom Filters: Probabilistic Set Membership | concept | 1 | Open |
| Fibonacci Heaps: Amortized Bounds That Make Dijkstra Faster | concept | 1 | Open |
| Pairing Heaps and the Engineering-vs-Theory Tradeoff | concept | 1 | Open |
| Persistent Data Structures and Functional Spines | concept | 1 | Open |
| Potential Method and Formal Amortized Cost Accounting | concept | 1 | Open |
| Randomized Data Structures: Skip Lists, Treaps, Randomized BSTs | concept | 1 | Open |
Red-Black Trees: Invariants, Rotations, and O(log n) Guarantees | concept | 1 | Open |
| Resources | resource | 3 | Open |
| Segment Trees and Fenwick Trees for Range Queries | concept | 1 | Open |
| Skip Lists as a Randomized Balanced-BST Replacement | concept | 1 | Open |
| Succinct and Cache-Oblivious Structures (Research-Level Intro) | concept | 1 | Open |
| The Union-Find Problem and the Naive Representation | concept | 1 | Open |
Union by Rank and Path Compression: Near-alpha(n) Amortized | concept | 1 | Open |
| Why Amortized Analysis: Smoothing Worst-Case Spikes | concept | 1 | Open |