Алгоритмы и структуры данных (основной поток) 10. Деревья поиска: AVL-дерево, Splay-дерево

At 00:00:00 the lecture begins with an introduction. At 00:00:05 the instructor announces the upcoming topic of search trees. At 00:00:46 the problem is formulated. At 00:07:13 the naive binary search tree is discussed. At 00:11:48 the find operation is explained. At 00:13:47 insert is covered. At 00:17:28 erase is described. At 00:24:55 the AVL tree is introduced. At 00:29:12 the logarithmic height property of the AVL tree is stated. At 00:37:43 rotations are explained. At 00:42:19 it is shown how rotations maintain the AVL invariant. At 01:00:22 the splay tree is presented. At 01:07:17 its purpose is discussed. At 01:09:07 a second discussion on its purpose follows. At 01:10:25 the amortized time claim is stated. At 01:11:20 the potential method is recalled. At 01:15:06 the proof of the claim is given. At 01:17:23 a lemma about the evaluation of splay(x) is presented.