10.1 AVL Tree - Insertion and Rotations

39:41
10.2 B Trees and B+ Trees. How they are useful in Databases

51:08
2.6.3 Heap - Heap Sort - Heapify - Priority Queues

20:38
AVL Trees & Rotations (Self-Balancing Binary Search Trees)

18:56
9.1 Knuth-Morris-Pratt KMP String Matching Algorithm

12:39
Understanding B-Trees: The Data Structure Behind Modern Databases

18:31
5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search

17:04
Hashing Technique - Simplified

1:06:14