CSCE 42603 — Advanced Data Structures
This course continues the study of data structures, algorithmic analysis for these data structures, and their efficient implementation to support standard library in programming languages. Topics include: AVL trees, Red-Black trees, Splay trees, Optimal Binary Search trees, 2-3 tree, 2-3-4 tree, B-trees, Segment trees, Leftist Heaps, Binomial Heaps, Fibonacci Heap, Disjoint Set, Hashing, and big integer with hundreds to thousands of digits. Prerequisite: CSCE 31903 or CSCE 319H3 , each with a grade of C or better. (Typically offered: Irregular)
Prerequisites: CSCE 31903