Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Segment 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
1
Intro
2
Segment Tree Structure
3
Array Representation
4
Building the Tree
5
Range Query
6
Point Update
7
Problem - Range Sum Query Mutable
8
Segment Tree Implementation
9
Range Sum Query Solution
10
Range Minimum Query
11
Segment Tree Generalization
12
The Range Update Problem
13
Lazy Propagation Structure
14
Push Down Operation
15
Range Update with Lazy
16
Query with Lazy
17
Problem - Range Addition
18
Range Addition Solution
19
Range Set Operation
20
Problem - Count of Range Sum
21
Count Range Sum Approach
22
Count Range Sum Solution
23
Iterative Segment Tree
24
Iterative Query and Update
25
Problem - Count Smaller After Self
26
Count Smaller Solution
27
2D Segment Trees
28
Problem - Range Sum Query 2D Mutable
29
2D Segment Tree Solution
30
Persistent Segment Trees
31
Dynamic Segment Trees
32
Segment Tree vs BIT
33
Common Segment Tree Bugs
34
Quiz: Segment Trees
35
Section Recap
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
Persistent Data Structures
0/37
11.1
Intro
2 minutes
100%
Tasks
Read Unit