54. Maximum Width of a Binary Tree

Objective: Given a binary Tree, write an algorithm to find the maximum width.

Note: The maximum width of a tree is nothing but the Max(nodes at each level).

Example:

Approach:

Do level order traversal and in recursive calls count the number of nodes at each level and keep track of Max of them and at the end return the max.

Read this solution " Level Order Traversal, Print each level in separate line" and implement the above approach.

Maximum Width of a binary Tree is : 4

Related Problems:

- Print Right View of Binary Tree Medium
- Find the number of distinct Islands OR connected components. Hard
- Print all steps to convert one string to another string Medium
- Sorted Array to Binary Search Tree of Minimal Height Medium
- Print all subsets of an array with a sum equal to zero Medium