To view the lecture overheads your browser must support a postscript previewer. Alternatively you can download the lectures and print them. The lectures posted here are the most recent and corrected.
Lecture 1: Course Information and
Review (revised 1/7/99)
Lecture 2: Linked Lists
(revised 1/10/99)
Lecture 3: Multiple Linked Lists
Implementing Pointers with Arrays
(revised 1/13/99)
Lecture 4: Analysis of Algorithms
(revised 1/21/99)
Lecture 5: Analysis of Recursive Algorithms
(revised 1/21/99)
Lecture 6: Trees and Traversals
(revised 1/21/99)
Lecture 7: Binary Search Trees I
(revised 3/13/99)
Lecture 8: Binary Search Trees II
(revised 3/13/99)
Lecture 9: AVL Trees I
(revised 2/3/99)
Lecture 10: AVL Trees II
(revised 2/3/99)
Lecture 11: Splay Trees
(revised 2/3/99)
Lecture 12: B-Trees
(revised 2/28/99)
Lecture 13: Multidimensional Search Trees
(revised 2/28/99)
Lecture 14: Hashing I
(revised 2/28/99)
Lecture 15: Hashing II
(revised 2/28/99)
Lecture 16: Priority Queues and Binary Heaps
(revised 2/28/99)
Lecture 17: d-Heaps
(revised 2/28/99)
Lecture 18: Leftist Heaps and Skew Heaps
(revised 3/3/99)
Lecture 19: Calendar Queue
(revised 3/13/99)
Lecture 20: Quicksort and Mergesort
(revised 3/13/99)
Lecture 21: Radix Sort
(revised 3/13/99)
Lecture 22: Dynamic Equivalence (Union, Find)
(revised 3/13/99)
ladner@cs.washington.edu