6. AVL Trees, AVL Sort
MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Erik Demaine
Chapters
00:00 title slate
00:20 lecture overview
02:50 height of a tree
06:40 height of a node
10:40 AVL tree
14:40 AVL tree balanced
29:00 AVL insert example
32:45 rotation
40:05 general AVL insert
48:42 AVL sort
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 6. AVL Trees, AVL Sort канала MIT OpenCourseWare
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Erik Demaine
Chapters
00:00 title slate
00:20 lecture overview
02:50 height of a tree
06:40 height of a node
10:40 AVL tree
14:40 AVL tree balanced
29:00 AVL insert example
32:45 rotation
40:05 general AVL insert
48:42 AVL sort
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 6. AVL Trees, AVL Sort канала MIT OpenCourseWare
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
21. DP III: Parenthesization, Edit Distance, KnapsackAVL tree source code7. Counting Sort, Radix Sort, Lower Bounds for Sorting10.1 AVL Tree - Insertion and RotationsDelete a node from Binary Search TreeAVL Trees & Rotations (Self-Balancing Binary Search Trees)How To Speak by Patrick WinstonMath Has a Fatal FlawAVL 1 Introduction10.2 B Trees and B+ Trees. How they are useful in DatabasesAVL Tree Insertion5.14 AVL tree Insertion | with solved example | Data structures8. Hashing with Chaining17. Complexity: Approximation Algorithms19. Dynamic Programming I: Fibonacci, Shortest Paths2. Models of Computation, Document Distance5. Binary Search Trees, BST SortCoding Trees in Python - Computerphile1. Algorithms and Computation13. Breadth-First Search (BFS)