LLVM's Flat-Buffer Tree for IR Dominators: O(1) Reads vs O(n) Moves
Compiler optimization passes live and die on tree traversal. LLVM's dominator analysis alone queries ancestor relationships thousands of times per function. A real C++ translation unit with heavy temp