662. Maximum Width of Binary Tree
Given a binary tree, write a function to get 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 right most non-null nodes in the level, where the null
nodes between the end-nodes are also counted into the length calculation.
It is guaranteed that the answer will in the range of 32-bit signed integer.
Example 1:
Input: 1 / \ 3 2 / \ \ 5 3 9 Output: 4 Explanation: The maximum width existing in the third level with the length 4 (5,3,null,9).
Example 2:
Input: 1 / 3 / \ 5 3 Output: 2 Explanation: The maximum width existing in the third level with the length 2 (5,3).
Example 3:
Input: 1 / \ 3 2 / 5 Output: 2 Explanation: The maximum width existing in the second level with the length 2 (3,2).
Example 4:
Input: 1 / \ 3 2 / \ 5 9 / \ 6 7 Output: 8 Explanation:The maximum width existing in the fourth level with the length 8 (6,null,null,null,null,null,null,7).
Constraints:
- The given binary tree will have between
1
and3000
nodes.
解题思路:首先使用树的层序遍历,记录好最左边节点和最右边节点的位置即可,该题因为溢出的问题,要对起始位置做调整,代码如下:
class Solution {
public:
int widthOfBinaryTree(TreeNode* root) {
if(root == NULL)
return 0;
queue<pair<TreeNode*, double>>q;
q.push({root,1});
double res = 0;
while(!q.empty())
{
int n = q.size();
double left = q.front().second;
double right = left;
for(int i = 0; i < n; i++)
{
TreeNode *pNode = q.front().first;
right = q.front().second;
// this step is done to prevent the overflow so that each level has indexing starting from 1
int index = right - left;
q.pop();
if(pNode->left)
q.push(make_pair(pNode->left, 2*index));
if(pNode->right)
q.push(make_pair(pNode->right, 2*index + 1));
}
res = max(res,right - left + 1);
}
return (int)res;
}
};
662. Maximum Width of Binary Tree(discuss)