牛客BM27 按之字形顺序打印二叉树【中等 层序遍历】

题目

链接地址：
https://www.nowcoder.com/practice/91b69814117f4e8097390d107d2efbe0

思路

核心：二叉树层序遍历

参考答案

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param pRoot TreeNode类
     * @return int整型ArrayList<ArrayList<>>
     */
    public ArrayList<ArrayList<Integer>> Print (TreeNode pRoot) {
        ArrayList<ArrayList<Integer>> ans = new ArrayList<>();
        if (pRoot == null) return ans;
        Queue<TreeNode> q = new LinkedList<>();
        LinkedList<Integer> rd = new LinkedList<>();
        q.add(pRoot);

        boolean readFromLeft = true;
        while (!q.isEmpty()) {
            int size = q.size();
            for (int i = 0; i < size; i++) {
                TreeNode pop = q.poll();
                rd.add(pop.val);
                if (pop.left != null) {
                    q.add(pop.left);
                }

                if (pop.right != null) {
                    q.add(pop.right);
                }
            }

            if (readFromLeft) {
                ArrayList<Integer> ll = new ArrayList<>();
                while (!rd.isEmpty()) {
                    ll.add(rd.pollFirst());
                }
                ans.add(ll);
            } else {
                ArrayList<Integer> ll = new ArrayList<>();
                while (!rd.isEmpty()) {
                    ll.add(rd.pollLast());
                }
                ans.add(ll);
            }

            readFromLeft = !readFromLeft;
        }
        return ans;
    }
}