Answer: Wipro OA Question 2024 September | Trees & BFS | on-campus

Solution: Maximum Width of Binary Tree — BFS with Node Indexing Approach We use BFS with position indexing. We assign each node a virtual index as if the tree were a complete binary tree: If a node has index i, its left child has index 2 * i and its right child has index 2 * i + 1. At each level, the width is lastIndex - firstIndex + 1. We normalize indices at each level (subtract the first index) ...