题目描述
请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。
代码
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) {
ArrayList<Integer> arr;
ArrayList<ArrayList<Integer> > res = new ArrayList<ArrayList<Integer> >();
TreeNode root = pRoot;
//用于存奇数层的节点
Stack<TreeNode> stack1 = new Stack<TreeNode>();
//用于存储偶数层的节点
Stack<TreeNode> stack2 = new Stack<TreeNode>();
stack1.push(root);
int layer = 1;
while(!stack1.isEmpty()||!stack2.isEmpty()){
if(layer%2!=0){
arr = new ArrayList<Integer>();
while(!stack1.isEmpty()){
TreeNode node = stack1.pop();
if(node!=null){
arr.add(node.val);
stack2.push(node.left);
stack2.push(node.right);
}
}
if(!arr.isEmpty()){
res.add(arr);
layer++;
}
}else{
arr = new ArrayList<Integer>();
while(!stack2.isEmpty()){
TreeNode node = stack2.pop();
if(node!=null){
arr.add(node.val);
stack1.push(node.right);
stack1.push(node.left);
}
}
if(!arr.isEmpty()){
res.add(arr);
layer++;
}
}
}
return res;
}
}