6.006 | Spring 2008 | Undergraduate

Introduction to Algorithms

Lecture Notes

Lecture 4: Balanced Binary Search Trees


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
Learning Resource Types
assignment Problem Sets
grading Exams with Solutions
notes Lecture Notes
assignment_turned_in Presentation Assignments with Examples