🎓How I Study AIHISA
📖Read
📄Papers📰Blogs🎬Courses
💡Learn
🛤️Paths📚Topics💡Concepts🎴Shorts
🎯Practice
🧩Problems🎯Prompts🧠Review
Search

Concepts3

Category

🔷All∑Math⚙️Algo🗂️DS📚Theory

Level

AllBeginnerIntermediateAdvanced
Filtering by:
#link-cut tree
🗂️Data StructureAdvanced

Persistent DSU (Fully Persistent Union-Find)

A persistent DSU (Union-Find) keeps all historical versions so you can query connectivity at any past version and even branch new futures from old states.

#persistent dsu#fully persistent union-find#union by rank+12
🗂️Data StructureAdvanced

Link-Cut Tree

A Link-Cut Tree (LCT) maintains a dynamic forest and supports link, cut, and path queries in O(log n) amortized time.

#link-cut tree#dynamic tree#splay tree+12
🗂️Data StructureAdvanced

Splay Tree

A splay tree is a self-adjusting binary search tree that moves the most recently accessed node to the root with rotations.

#splay tree#self-adjusting bst#zig+12