Advanced Data Structures

Syllabus
Objective

• Comprehension of advanced data structures and implement them

in C#.
Contents

1. Threaded Binary Search Tree (J. M. Morris (1979))

2. AVL Tree (Georgy Aldelson-Velsky and E. M. Landis (1962))
3. Red Black Tree (Rudolf Bayer (1972), Leonidas J. Guibas and
Robert Sedgewick (1978))
4. Splay Tree (Daniel Sleator and Robert Tarjan (1985))
5. Multiway Tree
B-Tree (Rudolf Bayer and Edward McCreight (1972))
Contents

6. B* Tree
B+ Tree
7. Trie (Rene de la Briandais (1959), Edward Fredkin (1960))
8. PATRICIA Tree (D. R. Morrison (1968))
Burst Trie
9. Binary Heap (J. W. J. Williams (1964))
Leftist Heap (Clark Allan Crane (1972))
Skew Heap (Daniel Sleator and Robert Tarjan (1986))
Contents

10.Binomial Heap (Jean Vuillemin (1978))

11.Fibonacci Heap (Michael Fredman and Robert Tarjan (1984))
Pairing Heap (Michael Fredman, Robert Sedgewick, Daniel
Sleator, and Robert Tarjan (1986))
12.Treap (Jean Vuillemin (1980), Cecilia Aragon and Raimund Seidel
(1989))
Skip List (William Pugh (1989))
Markings

• Mid test 35%

• Final test 35%
• Assignments 30%