662. Maximum Width of Binary Tree

Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a full binary tree, but some nodes are null.

The width of one level is defined as the length between the end-nodes (the leftmost and right most non-null nodes in the level, where the nullnodes between the end-nodes are also counted into the length calculation.

Example 1:

Example 2:

Example 3:

Example 4:

Note: Answer will in the range of 32-bit signed integer.


Leave a Reply

Your email address will not be published. Required fields are marked *