高级数据结构与算法分析

目录

• Lec 1: AVL Trees, Splay Trees and Amortized Analysis
• Lec 2: Red-Black Trees and B+ Trees
• Lec 3: Inverted File Index
• Lec 4: Leftist Heaps and Skew Heaps
• Lec 5: Binomial Queue
• Lec 6: Backtracking
• Lec 7: Divide and Conquer
• Lec 8: Dynamic Programming
• Lec 9: Greedy Algorithms
• Lec 10: P/NP Problems
• Lec 11: Approximation
• Lec 12: Local Search
• Lec 13: Randomized Algorithms
• Lec 14: Parallel Algorithms
• Lec 15: External Sorting