Concepts5
📚TheoryIntermediate
Amortized Analysis
Amortized analysis measures the average cost per operation over a worst-case sequence, not over random inputs.
#amortized analysis#aggregate method#accounting method+12
🗂️Data StructureAdvanced
Top Tree
Top trees are dynamic tree data structures that represent a forest as a hierarchy of clusters, allowing O(log n) amortized time for link, cut, path queries/updates, and many subtree queries.
#top tree#dynamic tree#link cut+12
🗂️Data StructureAdvanced
Euler Tour Tree
An Euler Tour Tree represents each rooted tree as a DFS open/close sequence so that every subtree is a single contiguous interval.
#euler tour tree#implicit treap#dynamic forest+11
🗂️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