Loading repovive.com/roadmaps/data-structures
Roadmaps
Data Structures
Persistent Data Structures
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
Persistent Data Structures
0/37
1
Intro
2
Types of Persistence
3
The Path Copying Technique
4
Sharing Unchanged Subtrees
5
Persistent Array
6
Persistent Array Implementation
7
Query and Update Functions
8
Persistent Segment Tree
9
Range Query on Version
10
Problem - Kth Number in Range
11
Kth Number: The Idea
12
Kth Number: Implementation
13
Kth Number: Building
14
Problem - Count in Range
15
Count in Range Solution
16
The Fat Node Method
17
Persistent Union-Find
18
Persistent UF Applications
19
Persistent Treap
20
Persistent Treap Operations
21
Problem - Version Queries
22
Version Queries Solution
23
Copy-on-Write Semantics
24
Functional Data Structures
25
Persistent Rope
26
Space Optimization
27
Memory Analysis
28
Full Persistence
29
Version Trees
30
Application: Undo/Redo
31
Application: Git-like VCS
32
Application: Database Snapshots
33
Implementation Tips
34
Common Bugs
35
Persistence vs Rollback
36
Quiz: Persistent Data Structures
37
Section Recap
19.1
Intro
3 minutes
100%
Tasks
Read Unit