6.006 | Spring 2008 | Undergraduate

Introduction to Algorithms

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
Download File
DOWNLOAD

Course Info

Departments
As Taught In
Spring 2008
Level
Undergraduate
Topics
Learning Resource Types
Problem Sets
Exams with Solutions
Lecture Notes
Presentation Assignments with Examples
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2024 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2024 Massachusetts Institute of Technology