Module 5: Advanced Data Structures & Amortized Analysis

This page aggregates the generated reference routes used by the learner-facing module.

• Semester: semester-02-algorithms
• App: foundations

Read only if stuck

• CLRS 13.2 Rotations
• CLRS 13.3 Insertion
• CLRS 13.4 Deletion
• Sedgewick balanced trees
• Sedgewick balanced trees (2)
• CLRS 19.1 Disjoint-set operations
• CLRS 19.2 Linked-list representation
• CLRS 19.4 Analysis of union by rank with path compression
• CLRS 21.2 Kruskal and Prim
• Competitive Programming 4.3 MST
• Sedgewick priority queues
• Skiena pairing heap
• CLRS 16.1 Aggregate analysis
• CLRS 16.2 The accounting method
• CLRS 16.3 The potential method
• CLRS 16.4 Dynamic tables
• Grokking Algorithms Chapter 11
• Competitive Programming 2.4.3 Segment tree
• Competitive Programming 2.4.4 Fenwick tree