Concepts2
🗂️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
Heavy-Light Decomposition
Heavy-Light Decomposition (HLD) breaks a tree into O(n) disjoint chains so that any root-to-node path crosses only O(log n) chains.
#heavy light decomposition#hld c++#segment tree on tree+10