662. Maximum Width of Binary Tree
Medium
Given the root
of a binary tree, return the maximum width of the given tree.
The maximum width of a tree is the maximum width among all levels.
The width of one level is defined as the length between the end-nodes (the leftmost and rightmost non-null nodes), where the null nodes between the end-nodes that would be present in a complete binary tree extending down to that level are also counted into the length calculation.
It is guaranteed that the answer will in the range of a 32-bit signed integer.
Example 1:
Example 2:
Example 3:
Constraints:
The number of nodes in the tree is in the range
[1, 3000]
.-100 <= Node.val <= 100
解題
Last updated