Leetcode 662. Maximum Width of Binary Tree

Compute the maximum width across all levels of a binary tree where width counts null gaps as if the tree were a complete binary tree; do this by tracking node positions (e.g., heap-style indices) per level and taking the largest (right_index - left_index + 1).