Leetcode 662. Maximum Width of Binary Tree

文章作者：Tyan
博客：noahsnail.com  |  CSDN  | 

1. Description

Maximum Width of Binary Tree

2. Solution

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int widthOfBinaryTree(TreeNode* root) {
        if(!root) {
            return 0;
        }
        vector level;
        root->val = 1;
        level.push_back(root);
        int maxWidth = 0;
        levelOrder(level, maxWidth);
        return maxWidth;
    }


private:
    void levelOrder(vector level, int& maxWidth) {
        maxWidth = max(maxWidth, level[level.size() - 1]->val - level[0]->val + 1);
        vector nextLevel;
        for(int i = 0; i < level.size(); i++) {
            TreeNode* current = level[i];
            if(current) {
                if(current->left) {
                    current->left->val = current->val * 2 - 1;
                    nextLevel.push_back(current->left);
                }
                if(current->right) {
                    current->right->val = current->val * 2;
                    nextLevel.push_back(current->right);
                }
            }
        }
        if(!nextLevel.empty()) {
            levelOrder(nextLevel, maxWidth);
        }
    }
};

Reference

1. https://leetcode.com/problems/maximum-width-of-binary-tree/description/