Data Structures -> Persistent Treap

Persistent split/merge treap for branching list or sequence versions where old roots remain alive.

• Topic slug: data-structures/persistent-treap
• Tutorial page: Open tutorial
• Ladder page: Open ladder
• Repo problems currently tagged here: 1
• Repo companion pages: 5
• Curated external problems: 1

Microtopics

• persistent-treap
• persistent-implicit-treap
• split-merge-persistence
• branching-list-versions
• path-copying
• subtree-sum

Learning Sources

Source	Type
OI Wiki persistent balanced tree	Reference
USACO Guide treaps	Reference

Practice Sources

Source	Type
E-olymp Persistent list	Practice

Repo Companion Material

Material	Type
Persistent Treap hot sheet	quick reference
Persistent List note	anchor note
Persistent Treap starter route	starter route
Persistent Data Structures tutorial	compare point
Treap / Implicit Treap tutorial	compare point

Curated External Problems

Core

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Persistent List	E-olymp	Hard	Implicit Treap, Persistence	Data-Structure-Heavy; Modeling-Heavy	Split And Merge	Split-Merge; Branching-Versions; Sequence-Persistence	The cleanest first benchmark where merge/head/tail on old list roots force persistent split/merge treap rather than fixed-array path copying.

Repo Problems

Code	Title	Fit	Difficulty	Pattern	Note	Solution
PERSISTENTLIST	Persistent List	primary	hard	-	Note	Code

Regeneration

python3 scripts/generate_problem_catalog.py