Summary

Builds a min Cartesian tree and extracts roots through a priority queue.

How it Works

• Build the Cartesian tree with a monotonic stack.

• Extract the smallest available subtree root.

• Add that root’s children to the priority queue and repeat.