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 Stack in reverse order Beginner
- Depth First Search/Traversal in Binary Tree Beginner
- Print Nodes Between Two Levels in Binary Tree Medium
- Text Justification Problem (OR Word Wrap Problem) - Leetcode 68 Hard
- Convert Sorted Singly Linked List to Balanced Binary Search Tree Medium