43:08
10.1 AVL Tree - Insertion and Rotations
13:30
AVL Tree Visually Explained
20:19
Implement A Binary Heap - An Efficient Implementation of The Priority Queue ADT (Abstract Data Type)
23:16
Notations asymptotiques 101 : Grand O, Grand Oméga et Thêta (Cours intensif d'analyse asymptotique)
34:08