void WidthMax(Node* root)
{
    if(root != nullptr)
    {
        queue<Node*> NodeSeq;
        int curLevel = 1;
        int curLevelnode = 0;
        unordered_map<Node*,int> Level;
        int width = -1;
        Level[root] = 1;
        NodeSeq.push(root);
        while(!NodeSeq.empty())
        {
            Node* Front = NodeSeq.front();
            NodeSeq.pop();
            if(Level[Front] == curLevel)
            {
                curLevelnode++;
            }
            else
            {
                width = max(width,curLevelnode);
                curLevel++;
                curLevelnode = 1;
            }
            if(Front->left) 
            {
                NodeSeq.push(Front->left);
                Level[Front->left] = curLevel + 1;
            }
            if(Front->right)
            {
                NodeSeq.push(Front->right);
                Level[Front->right] = curLevel + 1;
            }
        }
        cout << width << endl;
    }
}