5. Binary Search Trees, BST Sort
MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Srini Devadas
Chapters
00:00 title slate
00:20 lecture overview
01:50 motivation behind BST
08:30 shoot down known data structures
21:35 BST introduction
26:06 BST structure
27:43 insert 42 (k=3) to BST
35:18 find.min(); other BST operations
36:45 augmented BST example
37:59 Augment BST
45:30 example compute rank t
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 5. Binary Search Trees, BST Sort канала MIT OpenCourseWare
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Srini Devadas
Chapters
00:00 title slate
00:20 lecture overview
01:50 motivation behind BST
08:30 shoot down known data structures
21:35 BST introduction
26:06 BST structure
27:43 insert 42 (k=3) to BST
35:18 find.min(); other BST operations
36:45 augmented BST example
37:59 Augment BST
45:30 example compute rank t
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 5. Binary Search Trees, BST Sort канала MIT OpenCourseWare
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
6. AVL Trees, AVL SortData structures: Binary Search TreeDelete a node from Binary Search TreeData Structures: Trees4. Heaps and Heap SortEasy Google Coding Interview With Ben Awad7. Counting Sort, Radix Sort, Lower Bounds for Sorting15 German brands YOU pronounce WRONG! | German Girl in America8. Hashing with Chaining14. Depth-First Search (DFS), Topological SortBinary Tree Bootcamp: Full, Complete, & Perfect Trees. Preorder, Inorder, & Postorder Traversal.15. Single-Source Shortest Paths ProblemPython Data Structures #5: Binary Search Tree (BST)19. Dynamic Programming I: Fibonacci, Shortest PathsHow Computers Work, Compilation Video of Basics ExplainedR1. Asymptotic Complexity, Peak Finding10.2 B Trees and B+ Trees. How they are useful in Databases1. Algorithmic Thinking, Peak Finding2. Data Structures and Dynamic Arrays3. Insertion Sort, Merge Sort