Leetcode 662. 二叉树最大宽度

原题链接： Leetcode 662. Maximum Width of Binary Tree

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:

Input: root = [1,3,2,5,3,null,9]
Output: 4
Explanation: The maximum width exists in the third level with length 4 (5,3,null,9).

Example 2:

Input: root = [1,3,2,5,null,null,9,6,null,7]
Output: 7
Explanation: The maximum width exists in the fourth level with length 7 (6,null,null,null,null,null,7).

Example 3:

Input: root = [1,3,2,5]
Output: 2
Explanation: The maximum width exists in the second level with length 2 (3,2).

Constraints:

• The number of nodes in the tree is in the range [1, 3000].
• -100 <= Node.val <= 100

---

方法一：层次遍历+计数

思路：

C++代码：

/**
 * 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) {}
 * };
 */
/**
 * 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) {
        unsigned long long res=1;

        // 队列存储结点以及结点编号
        queue<pair<TreeNode*, unsigned long long>> bfs;
        bfs.emplace(root, 1L);

        // 只要队列不为空
        while(!bfs.empty())
        {
            // n为当前队列的元素
            int n = bfs.size();
            unsigned long long left=0, right=0;

            for(int i=0; i<n; i++)
            {
                // 取出队头
                pair<TreeNode*, unsigned long long> cur = bfs.front();
                bfs.pop();

                // 找到该层最左和最右的结点编号
                if(i==0) left=cur.second;
                if(i==n-1) right=cur.second;

                // 当前结点如果有左右孩子 也编号入队
                if(cur.first->left) bfs.emplace(cur.first->left, cur.second*2);
                if(cur.first->right) bfs.emplace(cur.first->right, cur.second*2+1);
            }

            res = max(res, (right-left+1));
        }
        return res;
    }
};