题目:
请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。
思路:
利用两个栈辅助输出
奇数行的栈,先存右结点,后存左结点,这样就实现了从左向右输出。
偶数行的栈,先存左结点,后存右结点,这样就实现了从右向左输出。
程序:
import java.util.ArrayList;
import java.util.Stack;
class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
public class subject59 {
public static ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
//存结果
ArrayList<ArrayList<Integer>> arrlist = new ArrayList<ArrayList<Integer>>();
if(pRoot == null) {
return arrlist;
}
//建立两个栈
Stack<TreeNode> stack1 = new Stack<TreeNode>();
Stack<TreeNode> stack2 = new Stack<TreeNode>();
//arr存每一行的数字
ArrayList<Integer> arr = new ArrayList<Integer>();
stack1.push(pRoot);
while(! stack1.isEmpty() || ! stack2.isEmpty()) {
//奇数行,从左向右打印
while(! stack1.isEmpty()) {
TreeNode node1 = stack1.pop();
arr.add(node1.val);
//先存左结节,后存右结节
if(node1.left != null) {
stack2.push(node1.left);
}
if(node1.right != null) {
stack2.push(node1.right);
}
}
if(arr.size() > 0) {
arrlist.add(arr);
}
//偶数行,从右向左打印
arr = new ArrayList<Integer>();
while(! stack2.isEmpty()) {
TreeNode node2 = stack2.pop();
arr.add(node2.val);
//先存右结节,后存左结节
if(node2.right != null) {
stack1.push(node2.right);
}
if(node2.left != null) {
stack1.push(node2.left);
}
}
if(arr.size() > 0) {
arrlist.add(arr);
}
arr = new ArrayList<Integer>();
}
return arrlist;
}
public static void main(String args[]) {
TreeNode root = new TreeNode(1);
root.left = new TreeNode(2);
root.right = new TreeNode(3);
root.left.left = new TreeNode(4);
root.left.right = new TreeNode(5);
System.out.println(Print(root));
}
}