# Maximum Width In Binary Tree

Posted: 7 Oct, 2020
Difficulty: Moderate

## PROBLEM STATEMENT

#### The width of one level is defined as the length between the leftmost and the rightmost, non-null nodes in the level, where the null nodes in between the leftmost and rightmost are excluded into length calculation.

##### For example :
``````For the given binary tree
`````` ``````The maximum width will be at the third level with the length of 3, i.e. {4, 5, 6}.
``````
##### Input Format :
``````The only line of input contains elements in the level order form. The line consists of values of nodes separated by a single space. In case a node is null, we take -1 in its place.

For example, the input for the tree depicted in the below image would be :
`````` ``````1
2 3
4 -1 5 6
-1 7 -1 -1 -1 -1
-1 -1
``````

#### Explanation :

``````Level 1 :
The root node of the tree is 1

Level 2 :
Left child of 1 = 2
Right child of 1 = 3

Level 3 :
Left child of 2 = 4
Right child of 2 = null (-1)
Left child of 3 = 5
Right child of 3 = 6

Level 4 :
Left child of 4 = null (-1)
Right child of 4 = 7
Left child of 5 = null (-1)
Right child of 5 = null (-1)
Left child of 6 = null (-1)
Right child of 6 = null (-1)

Level 5 :
Left child of 7 = null (-1)
Right child of 7 = null (-1)

The first not-null node(of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.
The input ends when all nodes at the last level are null(-1).
``````
##### Note :
``````The above format was just to provide clarity on how the input is formed for a given tree.
The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as:

1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
``````
##### Output Format :
``````For each input, print a single line that contains a single integer that denotes the maximum width for the given tree.
``````
##### Note :
``````You do not need to print anything; it has already been taken care of. Just implement the given function.
``````
##### Constraints :
``````0 <= 'N' <= 5 * 10 ^ 5
0 <= 'DATA' <= 10 ^ 6 and data != -1
Where ‘N’ is the total number of nodes in the binary tree, and 'DATA' is the value of the binary tree node.

Time Limit: 1sec.
`````` Approach 1

The straightforward intuition is that first, find the maximum levels possible in the given tree, called the "HEIGHT" of the tree. And then, for each level in height, we will find the number of nodes in each level. And the maximum number of the node among all levels will be the maximum width of the given binary tree. So the implementation of our intuition takes bellow steps:

1. First, find the height of the tree. And for finding the height of the tree, steps are:
• If the root is "NULL", return 0 as height is 0.
• Else, call the recursive function for left subtree and right subtree and which has a maximum height, which would be the height of the subtree for the "ROOT" node. So the height of the "ROOT" node will be
• 1+max("LEFT-HEIGHT", “RIGHT-HEIGHT”)
• Return the height of the "ROOT" node.

2. We will go for each level in [1: "HEIGHT"] and find how many nodes it contains at that level. The maximum number of nodes among all levels will be the maximum width of the given tree. For finding the number of nodes at any level, let's say "LEVEL", Steps are as follows:

• If the root is "NULL", return 0 as there will be no node possible.
• If "level" becomes 1, then return 1 as this root node is a node in required level.
• Else, call recursive on left subtree with "level-1" and store in "LEFTNODES" and call recursive on right subtree with "level-1" and store in "RIGHTNODES". So the total number of nodes for the current level will be "("LEFTNODES" +"RIGHTNODES" )".

3. The maximum number of nodes among all levels will be the maximum width of the given tree.