Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Advanced 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
1
Intro
2
Heavy-Light Decomposition
3
Heavy vs Light Edges
4
Quiz: Light Edge Bound
5
Building Heavy Chains
6
HLD Construction - Code
7
Path Queries with HLD
8
HLD Path Query - Code
9
Problem - Path Queries
10
Path Queries - Analysis
11
Path Queries - Implementation
12
Lessons from Path Queries
13
Centroid Decomposition
14
Finding the Centroid
15
Centroid Finding - Code
16
Quiz: Centroid Property
17
Centroid Decomposition - Structure
18
Centroid Decomposition - Code
19
Problem - Distance Queries
20
Distance Queries - Analysis
21
Distance Queries - Implementation
22
Lessons from Distance Queries
23
Treaps - Introduction
24
Treap Properties
25
Quiz: Treap Structure
26
Treap Operations - Split
27
Treap Operations - Merge
28
Treap Insert and Delete
29
Implicit Treaps
30
Implicit Treap - Split by Size
31
Problem - Cut and Paste
32
Cut and Paste - Analysis
33
Cut and Paste - Implementation
34
Lessons from Cut and Paste
35
Euler Tour Technique
36
Euler Tour - Construction
37
Subtree Queries with Euler Tour
38
HLD vs Euler Tour vs Centroid
39
Problem - Subtree Queries
40
Subtree Queries - Implementation
41
Challenge: Combined Techniques
42
Section Recap
Interval Trees
0/40
Wavelet Trees
0/37
Link-Cut Trees
0/39
Persistent Data Structures
0/37
15.1
Intro
3 minutes
100%
Tasks
Read Unit