把二叉树打印成多行_60

  ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
        ArrayList<ArrayList<Integer>> res=new ArrayList<>();

        if (pRoot==null){
            return res;
        }

        Queue<TreeNode> oddQueue=new LinkedList<>();
        Queue<TreeNode> evenQueue=new LinkedList<>();
        oddQueue.add(pRoot);

        //当前遍历奇书行
        boolean isOdd=true;
        //当前遍历的是
        while (!oddQueue.isEmpty()||!evenQueue.isEmpty()){
            ArrayList<Integer> itemRow= new ArrayList<>();

            if (isOdd){
                while (!oddQueue.isEmpty()){
                    final TreeNode poll = oddQueue.poll();
                    itemRow.add(poll.val);
                    if (poll.left!=null){
                        evenQueue.add(poll.left);
                    }
                    if (poll.right!=null){
                        evenQueue.add(poll.right);
                    }
                }
            }else {
                while (!evenQueue.isEmpty()){
                    final TreeNode poll = evenQueue.poll();
                    itemRow.add(poll.val);
                    if (poll.left!=null){
                        oddQueue.add(poll.left);
                    }
                    if (poll.right!=null){
                        oddQueue.add(poll.right);
                    }
                }
            }
            res.add(itemRow);
            isOdd=!isOdd;
            continue;
        }

        return res;
    }