Video details loaded
HomeMIT 6.006 Introduction to Algorithms, Fall 2011Lecture 6: AVL Trees, AVL Sort
MIT 6.006 Introduction to Algorithms, Fall 2011
Video 6 of 10
Lecture 6: AVL Trees, AVL Sort
51:59
Up Next
Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting
Description: 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.
Instructor: Erik Demaine