Home / Lectures / Introduction to Algorithms
Computer Science
Lecture 6: AVL Trees, AVL Sort
- Course
- Introduction to Algorithms
- Instructor
- Erik Demaine
- Department
- Electrical Engineering and Computer Science
- Recorded
- Fall 2011
- Level
- Undergraduate
Free account required. The lecture opens at MIT OpenCourseWare.
About this lecture
This lecture covers AVL trees, including how to insert elements and rebalance the tree, and then discusses the difference between abstract data types and data structures.
← Lecture 5: Binary Search Trees, BST SortLecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting →
More in Computer Science
Computer Science
Lecture 1: What is Computation?
Introduction to Computer Science and Programming in Python · Dr. Ana Bell
Computer Science
Lecture 2: Branching and Iteration
Introduction to Computer Science and Programming in Python · Dr. Ana Bell
Computer Science
Lecture 3: String Manipulation, Guess and Check, Approximations, Bisection
Introduction to Computer Science and Programming in Python · Dr. Ana Bell