1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find
7:04
2 Divide And Conquer
18:31
5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search
5:46
Union Find in 5 minutes — Data Structures & Algorithms
51:08
2.6.3 Heap - Heap Sort - Heapify - Priority Queues
20:12
3.5 Prims and Kruskals Algorithms - Greedy Method
42:15
G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression
18:56
1.11 Best Worst and Average Case Analysis
3:50:19