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

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

解法一：借用一个队列

思路： 注意从右到左遍历的时候添加元素的先后

import java.util.ArrayList;

/*
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) {
        ArrayList<ArrayList<Integer>> result = new ArrayList<>();
        if(pRoot==null) return result;
        ArrayList<TreeNode> layer =  new ArrayList<>();
        int size = 0;
        int presize = 1;
        boolean flag = false; //标记这一层从哪到哪打印
        layer.add(pRoot);
        while(!layer.isEmpty()){
            ArrayList<Integer> l = new ArrayList<>();
            if(flag==false){
                while(presize>0){
                    TreeNode t = layer.remove(0);
                    l.add(t.val);
                    presize--;
                    if(t.left!=null){
                        layer.add(t.left);
                        size++;
                    } 
                    if(t.right!=null){
                        layer.add(t.right);
                        size++;
                    }
                }
                flag = true;   
            }else{
                while(presize>0){
                    TreeNode t = layer.remove(presize-1);
                    l.add(t.val);
                    presize--;
                    if(t.right!=null){
                        layer.add(presize,t.right);
                        size++;
                    } 
                    if(t.left!=null){
                        layer.add(presize,t.left);
                        size++;
                    }
                }
                flag = false;
            }
            result.add(l);
            presize = size;
            size = 0;
        }
        return result;
    }
}

解法二：借用双栈

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 {


public static ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
        int layer = 1;
        //s1存奇数层节点
        Stack<TreeNode> s1 = new Stack<TreeNode>();
        s1.push(pRoot);
        //s2存偶数层节点
        Stack<TreeNode> s2 = new Stack<TreeNode>();
         
        ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
         
        while (!s1.empty() || !s2.empty()) {
            if (layer%2 != 0) {
                ArrayList<Integer> temp = new ArrayList<Integer>();
                while (!s1.empty()) {
                    TreeNode node = s1.pop();
                    if(node != null) {
                        temp.add(node.val);
                        System.out.print(node.val + " ");
                        s2.push(node.left);
                        s2.push(node.right);
                    }
                }
                if (!temp.isEmpty()) {
                    list.add(temp);
                    layer++;
                    System.out.println();
                }
            } else {
                ArrayList<Integer> temp = new ArrayList<Integer>();
                while (!s2.empty()) {
                    TreeNode node = s2.pop();
                    if(node != null) {
                        temp.add(node.val);
                        System.out.print(node.val + " ");
                        s1.push(node.right);
                        s1.push(node.left);
                    }
                }
                if (!temp.isEmpty()) {
                    list.add(temp);
                    layer++;
                    System.out.println();
                }
            }
        }
        return list;
    }
}

优化一下

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 {
public static ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
        //s1存奇数层节点
        Stack<TreeNode> s1 = new Stack<TreeNode>();
        s1.push(pRoot);
        //s2存偶数层节点
        Stack<TreeNode> s2 = new Stack<TreeNode>();
         
        ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
         
        while (!s1.empty() || !s2.empty()) {
                ArrayList<Integer> temp1 = new ArrayList<Integer>();
                while (!s1.empty()) {
                    TreeNode node = s1.pop();
                    if(node != null) {
                        temp1.add(node.val);
                        s2.push(node.left);
                        s2.push(node.right);
                    }
                }
                if (!temp1.isEmpty()) {
                    list.add(temp1);
                }
                ArrayList<Integer> temp2 = new ArrayList<Integer>();
                while (!s2.empty()) {
                    TreeNode node = s2.pop();
                    if(node != null) {
                        temp2.add(node.val);
                        
                        s1.push(node.right);
                        s1.push(node.left);
                    }
                }
                if (!temp2.isEmpty()) {
                    list.add(temp2);
                }
        }
        return list;
    }
}