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
Course Info
Instructors
Departments
As Taught In
Spring
2008
Level
Topics
Learning Resource Types
assignment
Problem Sets
grading
Exams with Solutions
notes
Lecture Notes
assignment_turned_in
Presentation Assignments with Examples
