Loading repovive.com/roadmaps/graph-theory
Roadmaps
Graph Theory
Tree Fundamentals
Problemset
Discussion
AI Helper
Graph Fundamentals
0/41
Depth First Search (DFS)
0/41
Breadth First Search (BFS)
0/40
Flood Fill & Grid Graphs
0/32
Bipartite Graphs
0/48
Tree Fundamentals
0/44
1
Intro
2
Visualizing a Tree
3
Rooting the Tree
4
Moving in a Tree
5
Tree DFS Template
6
Concept - Depth vs Height
7
Quiz: Tree Properties
8
LeetCode 104 Maximum Depth of Binary Tree - Problem Statement
9
LeetCode 104 Maximum Depth of Binary Tree - Strategy
10
LeetCode 104 Maximum Depth of Binary Tree - Implementation
11
Concept - Tree Dynamic Programming
12
CSES 1674 Subordinates - Problem Statement
13
CSES 1674 Subordinates - Strategy
14
CSES 1674 Subordinates - Implementation
15
Quiz: Subtree Size Computation
16
Concept - Tree Diameter
17
LeetCode 543 Diameter of Binary Tree - Problem Statement
18
LeetCode 543 Diameter of Binary Tree - Strategy
19
LeetCode 543 Diameter of Binary Tree - Implementation Details
20
LeetCode 543 Diameter of Binary Tree - Takeaway
21
Quiz: Tree Diameter
22
Concept - General Tree Diameter
23
CSES 1131 Tree Diameter - Problem Statement
24
CSES 1131 Tree Diameter - Double BFS Algorithm
25
CSES 1131 Tree Diameter - Why Double BFS Works
26
CSES 1131 Tree Diameter - Two Approaches Compared
27
Concept - Tree Centers
28
LeetCode 310 Minimum Height Trees - Problem Statement
29
LeetCode 310 Minimum Height Trees - Strategy
30
LeetCode 310 Minimum Height Trees - Implementation
31
Quiz: Tree Centers
32
LeetCode 100 Same Tree - Problem Statement
33
LeetCode 100 Same Tree - Strategy
34
LeetCode 100 Same Tree - Algorithm
35
LeetCode 100 Same Tree - Implementation
36
LeetCode 100 Same Tree - Lessons
37
Quiz: Tree Comparison
38
LeetCode 226 Invert Binary Tree - Problem Statement
39
LeetCode 226 Invert Binary Tree - Strategy
40
LeetCode 226 Invert Binary Tree - Algorithm
41
LeetCode 226 Invert Binary Tree - Implementation
42
LeetCode 226 Invert Binary Tree - Lessons
43
Quiz: Tree Inversion
44
Section Recap
Tree Diameter & Center
0/45
Subtree DP
0/44
Floyd-Warshall Algorithm
0/41
Dijkstra's Algorithm
0/40
Bellman-Ford Algorithm
0/48
Mixed Practice - Shortest Paths
0/36
Disjoint Set Union (DSU)
0/49
Minimum Spanning Trees
0/48
Topological Sort
0/41
DP on DAGs
0/50
Mixed Practice: Graph Traversals
0/35
Strongly Connected Components
0/45
2-SAT
0/51
Mixed Practice: Connectivity & MST
0/35
Rerooting Technique
0/39
Euler Tour Technique
0/51
Mixed Practice: Tree Fundamentals
0/29
Binary Lifting
0/50
Lowest Common Ancestor (LCA)
0/51
Games on Graphs
0/62
Heavy-Light Decomposition
0/49
Centroid Decomposition
0/55
Small-to-Large Merging
0/40
Functional Graphs
0/47
Mixed Practice: Advanced Tree Techniques
0/36
Bridges and Articulation Points
0/58
Network Flow
0/54
Maximum Bipartite Matching
0/50
Minimum Cut
0/47
Euler Paths and Circuits
0/37
Mixed Practice: Advanced Graphs
0/24
6.1
Intro
2 minutes
100%
Tasks
Read Unit