【2022初春】【LeetCode】【树】662. 二叉树最大宽度

基础想法是对的，但是做法和实现方式要学习，下标方法

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int widthOfBinaryTree(TreeNode root) {
        if(root==null) return 0;
        int res = 0;
        LinkedList<TreeNode> q = new LinkedList<>();
        root.val = 1;
        q.add(root);
        
        while(!q.isEmpty()){
            int time = q.size();
            res = Math.max(res,q.peekLast().val-q.peekFirst().val+1);
            for(int i=0; i<time; i++){
                TreeNode node = q.poll();
                if(node.left!=null){
                    node.left.val = node.val*2-1;
                    q.add(node.left);
                }
                if(node.right!=null){
                    node.right.val = node.val*2;
                    q.add(node.right);
                }
            }
        }
        return res;

    }
}