🌳

Graphs & Trees

Traversals, shortest paths, union-find, and tree algorithms.

Curriculum · 91 lessons

01Naive String Matchingintro4m 02Matrix Traversalintro4m 03AVL Tree Rotationsintro4m 04Max Flow and Min Cutintro4m 05Graph Representation Tradeoffsintro4m 06KMP Pattern Matching Deepintro5m 07Dijkstra with Decrease Keyintro5m 08Breadth First Search on Graphsintro4m 09Breadth First Search Applicationsintro4m 10The B Tree And B Plus Treeintro5m 11Depth First Search Applicationsintro4m 12Red Black Tree Rules Deepintro5m 13Depth First Search on Graphscore4m 14Checking if a Graph is Bipartitecore4m 15Topological Sort DFScore5m 16Tail Recursion and Stack Depthcore5m 17SPFA Shortest Pathcore5m 18The State Space Treecore4m 19Cycle Detection In Undirected Graphscore4m 20Bellman Ford Negative Cyclecore6m 21Multi Source BFScore4m 22Rolling Hash for Matchingcore6m 23Bipartite Matchingcore5m 24The Splay Treecore4m 25Depth First Searchcore4m 26Breadth First Searchcore5m 27Detecting Cycles in Directed Graphscore5m 28Cycle Detection In Directed Graphscore4m 29The Segment Tree Buildcore5m 30The Topological Sort Patterncore5m 31The Recursion Tree Methodcore5m 32Kruskal with Union Find Deepcore6m 33The Two Heaps Pattern for Medianscore5m 34The Segment Treecore6m 35Topological Sort With Kahncore5m 36The Segment Tree Introcore5m 37The Fenwick Tree Deepcore5m 38Heap Sort With A Heapcore5m 39Prim with Heap Deepcore6m 40The Euler Tour Techniquecore5m 41The Binary Search Treecore5m 42Minimum Spanning Tree With Primcore5m 43The Fenwick Binary Indexed Treecore5m 44Bellman Ford and Negative Edgescore5m 45The Binary Heap Operationscore5m 46Binary Indexed Tree Applicationscore5m 47Dijkstra With A Heapcore5m 48The Segment Tree Range Querycore5m 49The Lowest Common Ancestor Binary Liftingcore5m 50Lowest Common Ancestor with Binary Liftingcore5m 51The Wildcard Matching DPcore6m 52DP on Treescore5m 53The Two Heaps Patterncore5m 54The Binary Heapcore5m 55Bellman Ford For Negative Edgescore5m 56The Interval Treecore5m 57The Segment Tree Lazy Deepcore6m 58Topological Sortcore5m 59Maximum Flow with Edmonds Karpcore5m 60Minimum Spanning Tree with Kruskalcore5m 61Bipartite Matching with Hopcroft Karpcore5m 62KD Tree For Nearest Neighborcore6m 63The Merge Sort Treecore5m 64Tarjan Strongly Connected Componentscore5m 65The Balanced AVL Treecore5m 66The DFS Templateadvanced5m 67The BFS Templateadvanced5m 68Integer Overflow Handlingadvanced5m 69The Min Cut Max Flow Theoremadvanced5m 70Wildcard And Regex Matching DPadvanced6m 71Minimum Spanning Treeadvanced6m 72Zero One BFS with a Dequeadvanced5m 73The Balanced Tree AVLadvanced5m 74Union Findadvanced5m 75Bipartite Check By Coloringadvanced4m 76The Line Sweep with a Balanced Treeadvanced6m 77The Red Black Tree Ideaadvanced6m 78The Persistent Segment Treeadvanced6m 79Union Find With Path Compressionadvanced5m 80The Red Black Tree Intuitionadvanced5m 81The Union Find Structureadvanced5m 82KMP String Matchingadvanced6m 83The Centroid Decompositionadvanced6m 84Centroid Decompositionadvanced6m 85Dijkstra Shortest Pathadvanced6m 86Fenwick Tree Basicsadvanced5m 87DSU on Tree Small to Largeadvanced5m 88Articulation Points and Bridgesadvanced5m 89Segment Tree Basicsadvanced6m 90Strongly Connected Componentsadvanced6m 91The Suffix Tree Ideaadvanced5m