Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Link-Cut Trees
Problemset
Discussion
AI Helper
Arrays & Prefix Sums
0/50
Stacks & Monotonic Stacks
0/40
Queues & Deques
0/38
Hash Tables
0/40
Heaps & Priority Queues
0/43
Linked Lists
0/36
Binary Trees
0/35
Binary Search Trees
0/35
Tries
0/35
Union-Find
0/35
Segment Trees
0/35
Fenwick Trees
0/35
Sparse Tables
0/35
Sqrt Decomposition
0/42
Advanced Trees
0/42
Interval Trees
0/40
Wavelet Trees
0/37
Link-Cut Trees
0/39
1
Intro
2
Dynamic Tree Problems
3
Operations We Need
4
Splay Tree Review
5
Rotations
6
Preferred Paths
7
Auxiliary Trees
8
Path-Parent Pointer
9
The Access Operation
10
Access: Step by Step
11
FindRoot Operation
12
Link Operation
13
Cut Operation
14
MakeRoot Operation
15
Why Rerooting Works
16
Path Query
17
Path Update
18
LCA Query
19
Connected Query
20
Node Structure
21
Splay with Push Down
22
Rotate with Update
23
Example: Building a Tree
24
Example: Cut and Reconnect
25
Application: Dynamic MST
26
Application: Max Flow
27
Application: Online LCA
28
Problem - Dynamic Connectivity
29
Dynamic Connectivity Solution
30
Problem - Dynamic Path Queries
31
Dynamic Path Solution
32
Amortized Analysis
33
Space Complexity
34
Implementation Tips
35
Common Bugs
36
Euler Tour Trees
37
Top Trees
38
Quiz: Link-Cut Trees
39
Section Recap
Persistent Data Structures
0/37
18.1
Intro
3 minutes
100%
Tasks
Read Unit