Lecture 4 Notes: Balanced Binary Search Trees
Lecture Overview
The importance of being balanced
AVL trees
Denition
Balance
Insert
Other balanced trees
Data structures in general
Readings
CLRS Chapter 13. 1 and 13. 2 (but dierent approach: red-black
Lecture 1 Notes: Introduction and the
Document Distance Problem
Course Overview
Ecient procedures for solving problems on large inputs (Ex: entire works of Shakespeare, human genome, U.S. Highway map)
Scalability
Classic data structures and elementary
Lecture 2 Notes: More on the Document
Distance Problem
Lecture Overview
Today we will continue improving the algorithm for solving the document distance problem.
Asymptotic Notation: Dene notation precisely as we will use it to compare the
complexity and
Lecture 7 Notes: Hashing III: Open Addressing
Lecture Overview
Open Addressing, Probing Strategies
Uniform Hashing, Analysis
Advanced Hashing
Readings
CLRS Chapter 11.4 (and 11.3.3 and 11.5 if interested)
Open Addressing
Another approach to collisions
Lecture 6 Notes: Hashing II: Table
Doubling, Karp-Rabin
Lecture Overview
Table Resizing
Amortization
String Matching and Karp-Rabin
Rolling Hash
Readings
CLRS Chapter 17 and 32.2.
Recall:
Hashing with Chaining:
table
all possible
keys
U
k kk3
.
.
.
.
Lecture 3 Notes: Scheduling and Binary Search Trees
Lecture Overview
Runway reservation system
Denition
How to solve with lists
Binary Search Trees
Operations
Readings
CLRS Chapter 10, 12. 1-3
Runway Reservation System
Airport with single (very busy