解题思路
依然是常规的广度优先解决二叉树的层次问题,只不过为了能够记录null节点的个数,需要对每个节点进行标号,为了防止越界,每一层的标号都从0开始,每次遍历某一层时,用start记录初始下标,用index记录该层最后一个节点的下标,然后相减+1即是该层的宽度,不断更新最大宽度即可,此外为了防止下标越界,index和start都定义为long long类型,代码如下:
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int widthOfBinaryTree(TreeNode* root) {
int width = 0;
queue<pair<TreeNode*, int>> q;
q.push({root, 0});
while(!q.empty()) {
long long start = q.front().second;
long long n = q.size();
long long index = start;
for(long long i = 0; i < n; i ++) {
TreeNode* node = q.front().first;
index = q.front().second;
if(node->left != nullptr) q.push({node->left, index * 2 - start});
if(node->right != nullptr) q.push({node->right, index * 2 - start + 1});
q.pop();
}
width = max(width, (int)(index - start + 1));
}
return width;
}
};