二叉树的宽度<java版>

    public int solution(TreeNode node){
        LinkedList<TreeNode> queue=new LinkedList<>();
        queue.offer(node);
        int ans=1;
        TreeNode temNode=null;
        while (!queue.isEmpty()){
            ans=Math.max(ans,queue.size());
            int length=queue.size();
            while (length>0){
                temNode=queue.poll();
                if (temNode.leftNode!=null){
                    queue.offer(temNode.leftNode);
                }
                if (temNode.rightNode!=null){
                    queue.offer(temNode.rightNode);
                }
                length--;
            }
        }
        return ans;
    }