Lecture Notes
Lecture 4: Balanced Binary Search Trees
Description:
Lecture notes on balanced binary search trees, the importance of being balanced, AVL trees, other balanced trees, and data structures in general.
Resource Type:
Lecture Notes
pdf
1 MB
Lecture 4: Balanced Binary Search Trees
Course Info
Instructors
Departments
As Taught In
Spring
2008
Level
Course Info
Instructors
Departments
As Taught In
Spring
2008
Level
Learning Resource Types
grading
Exam Solutions
grading
Exams
notes
Lecture Notes
assignment_turned_in
Presentation Assignments with Examples
assignment
Problem Sets
