Presentations

Copyright © 2003, Michael T. Goodrich, Roberto Tamassia, David M. Mount, and John Wiley & Sons, Inc.
Permission to use the presentations below is granted to instructors and students of non-profit educational institutions for instructional purposes. Any other use requires a license.

Chapter 3: Analysis Tools

• Analysis of Algorithms

Chapter 4: Stacks, Queues, and Recursion

• Data Structures
• Stacks
• Queues

Chapter 5: Vectors, Lists, and Sequences

• Vectors
• Sequences

Chapter 6: Trees

• Trees

Chapter 7: Priority Queues

• Priority Queues
• Heaps
• Locators

Chapter 8: Dictionaries

• Dictionaries
• Hashing
• Skip Lists

Chapter 9: Search Trees

• Binary Search Trees
• AVL Trees
• (2,4) Trees
• Red-Black Trees

Chapter 10: Sorting, Sets, and Selection

• Divide and Conquer
• Merge Sort
• Sets
• Quick Sort
• Radix Sort
• Sorting Lower Bound
• Selection

Chapter 11: Text Processing

• Pattern Matching
• Tries

Chapter 12: Graphs

• Graphs
• Depth-First Search
• Breadth-First Search
• Biconnected Components
• Directed Graphs
• Minimum Spanning Tree
• Shortest Paths
• Program Graph