剑指offer-- 按之字形顺序打印二叉树

题目描述

请实现一个函数按照之字形打印二叉树，即第一行按照从左到右的顺序打印，第二层按照从右至左的顺序打印，第三行按照从左到右的顺序打印，其他行以此类推。

AC代码

import java.util.ArrayList;
import java.util.Queue;
import java.util.LinkedList;
import java.util.Collections;
/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
     Queue<TreeNode> queue = new LinkedList<>();
    ArrayList<ArrayList<Integer>> resList = new ArrayList<ArrayList<Integer>>();
    int order = 1;
    int curNode = 1;
    int nextNode = 0;
    public ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
        if(pRoot == null) return resList;
        queue.offer(pRoot);
        TreeNode tmp = null;
        ArrayList<Integer> curList = new ArrayList<Integer>();
        while(!queue.isEmpty()){
            tmp = queue.poll();
            curList.add(tmp.val);
            curNode--;
            if(tmp.left != null) {
                queue.offer(tmp.left);
                nextNode++;
            }
            if(tmp.right != null) {
                queue.offer(tmp.right);
                nextNode++;
            }
            if(curNode == 0){
                order++;
                if((order & 1) == 1) Collections.reverse(curList);
                resList.add(curList);
                curList = new ArrayList();
                curNode = nextNode;
                nextNode = 0;
            }
        }
        return resList;
    }
}