Lecture Notes -- Data Structures

These lecture notes are designed for on-line reference and review. Please do not print them on university computing facilities!!

• Lecture 1 -- Data Structures and Programming
• Lecture 2 -- Software Engineering and Top-Down Design
• Lecture 3 -- Stacks and Queues
• Lecture 4 -- Pointers and Dynamic Memory Allocation
• Lecture 5 -- Linked Stacks and Queues
• Lecture 6 -- Calculator Algorithms
• Lecture 7 -- Linked Lists: Insertion and Deletion
• Lecture 8 -- Do the Shuffle
• Lecture 9 -- Recursive and Doubly Linked Lists
• Lecture 10 -- Recursion and Backtracking
• Lecture 11 -- Applications of Recursion
• Lecture 12 -- Abstraction and Modules
• Lecture 13 -- Object-Oriented Programming
• Lecture 14 -- Simulations
• Midterm 1 -- Answer Key
• Lecture 15 -- Asymptotics
• Lecture 16 -- Introduction to Sorting
• Lecture 17 -- Mergesort and Quicksort
• Lecture 18 -- Heapsort and Priority Queues
• Lecture 19 -- Sequential and Binary Search
• Lecture 20 -- Access Formulas and Arrays
• Lecture 21 -- Hashing
• Lecture 22 -- Binary Search Trees
• Midterm 2 -- Answer Key
• Lecture 23 -- Random Search Trees
• Lecture 24 -- AVL Trees These will not be covered in class, but the implementation may be useful in doing the final program.
• Lecture 25 -- Red-Black Trees
• Lecture 26 -- Splay Trees
• Lecture 27 -- Graphs