Loading repovive.com/roadmaps/graph-problem-solving
Roadmaps
Graph: Problem Solving
Premium
Tree Algorithms
Problemset
Discussion
AI Helper
Getting Started
0/4
Shortest Path Variants
0/30
Grid Graphs
0/33
Connectivity (DSU and DFS)
0/27
DAG and Topological Sort
0/28
Tree Algorithms
0/39
1
Introduction to Tree Algorithms
2
What Tree Problems Solve
3
Problem - Possible Root Nodes
4
Possible Root Nodes - Why Naive Fails
5
Possible Root Nodes - Defining the DP
6
Possible Root Nodes - Transition
7
Possible Root Nodes - Base Cases
8
Possible Root Nodes - Implementation
9
Rerooting DP Template
10
Possible Root Nodes - Time and Space
11
Binary Lifting Template
12
Problem - Min Diameter After Merge
13
Min Diameter After Merge - Why Naive Fails
14
Min Diameter After Merge - Defining the DP
15
Min Diameter After Merge - Core Logic
16
Min Diameter After Merge - Implementation
17
Problem - Min Edge Reversals
18
Min Edge Reversals - Why Naive Fails
19
Min Edge Reversals - Defining the DP
20
Min Edge Reversals - Core Logic
21
Min Edge Reversals - Implementation
22
Problem - Collect Apples
23
Small-to-Large Merging
24
Collect Apples - Solution
25
Collect Apples - Why This Works
26
Quiz: Tree Techniques
27
Quiz: Rerooting DP
28
Common Mistakes in Tree Problems
29
Problem - Link Cut Centroids
30
Link Cut Centroids - Solution
31
Problem - Tree Requests
32
Tree Requests - Solution
33
Problem - Kingdom and its Cities
34
Kingdom and its Cities - Solution
35
Problem - Tree Isomorphism II
36
Tree Isomorphism II - Solution
37
Problem - Count on a Tree II
38
Count on a Tree II - Solution
39
Section Recap
Centroid Decomposition
0/30
6.1
Introduction to Tree Algorithms
4 minutes
100%
Premium Roadmap
You're previewing free content. Unlock all units to continue learning.
Subscribe
Tasks
Read Unit