Problem 662 · Medium

Maximum Width of Binary Tree

Index nodes as a complete tree; a level is as wide as the gap between its outermost indices.

Open the interactive visualisation