4.6 Optimal Binary Search Tree (Successful Search Only) - Dynamic Programming
57:00
4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming
28:24
4.5 0/1 Knapsack - Two Methods - Dynamic Programming
12:39
Understanding B-Trees: The Data Structure Behind Modern Databases
43:08
10.1 AVL Tree - Insertion and Rotations
15:46
How I Mastered Data Structures and Algorithms in 8 Weeks
51:08
2.6.3 Heap - Heap Sort - Heapify - Priority Queues
39:41
10.2 B Trees and B+ Trees. How they are useful in Databases
15:25