Least You Need to Know: Euler Tours, Subtree Intervals, and Flattened Trees
Les openen
An Euler-tour-style entry order can flatten a rooted tree so each subtree becomes a **contiguous interval** in an array. That converts many subtree problems into familiar range-query problems.