Find the maximum width of a binary tree

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

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

Input: A Binary Tree

Output: Maximum width of a given tree.


Maximum width of a given tree


The solution of this problem is very simple, 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

1 thought on “Find the maximum width of a binary tree”

Leave a Reply to Aman Rustagi Cancel reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.