59.按之字形顺序打印二叉树(java)

题目描述

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

解题思路

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

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

    }

}
*/
public class Solution {
    public ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
        int layer = 1;
        Stack<TreeNode> s1 = new Stack<>();  //s1存奇数层节点
        Stack<TreeNode> s2 = new Stack<>();  //s2存偶数层节点
        s1.push(pRoot);
        ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
        while(!s1.empty()||!s2.empty())
        {
            if(layer%2==1)
            {
                ArrayList<Integer> temp = new ArrayList<>();
                while(!s1.empty())
                {
                    TreeNode t = s1.pop();
                    if(t!=null)
                    {
                        temp.add(t.val);
                        s2.push(t.left);
                        s2.push(t.right);
                    }
                }
                if(!temp.isEmpty())  //判断当前层有没有节点
                {
                    list.add(temp);
                    layer++;
                }
            }
            else{
                ArrayList<Integer> temp = new ArrayList<>();
                while(!s2.empty())
                {
                    TreeNode t = s2.pop();
                    if(t!=null)
                    {
                        temp.add(t.val);
                        s1.push(t.right);
                        s1.push(t.left);
                    }
                }
                if(!temp.isEmpty())
                {
                    list.add(temp);
                    layer++;
                }
            }
        }
        return list;
    }

}