英文版高级数据结构PPT，内容包括： Amortized complexity (Web) External sorting & tournament trees (Sections 7.10.1, 7.10.2, and 5.8) Buffering (Section 7.10.3) Run generation & optimal merge patterns (Huffman trees) (Sections 7.10.4 and 7.10.5) Priority queues and merging (Section 5.6) Leftist trees, Binomial heaps and Fibonacci heaps (Sections 9.2, 9.3, and 9.4) Pairing heaps (Section 9.5) Double ended priority queues (Sections 9.6 and 9.7, Web) Static and dynamic weighted binary search trees (Section 10.1) AVL-trees (Section 10.2) Red-black trees (Section 10.3) Splay trees (Section 10.4) B-, B+ and B*-trees (Sections 11.1-11.3) Tries and digital search trees (Sections 12.1-12.3) Tries and packet forwarding (Section 12.5) Suffix trees (Section 12.4) Bloom filters (Section 8.4) Segment trees (readings) Interval trees Priority search trees (readings) k-d trees (readings) Quad and oct trees (readings) BSP trees R-trees 10.2) Red-black trees (Section 10.3) Splay trees (Section 10.4) B-, B+ and B*-trees (Sections 11.1-11.3) Tries and digital search trees (Sections 12.1-12.3) Tries and packet forwarding (Section 12.5) Suffix trees (Section 12.4) Bloom filters (Section 8.4) Segment trees (readings) Interval trees Priority search trees (readings) k-d trees (readings) Quad and oct trees (readings) BSP trees R-trees