题目:请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。
思路:第一行为根节点,第二行从右向左,第三行从左向右,第四行从右向左,以此类推......
可以借助两个栈来实现,栈的特点先进后出。
根节点入栈1;第二层入栈2按照先左孩子后右孩子的顺序;第三层入栈1按照先右孩子后左孩子的顺序,以此类推
总而言之:当入栈1时,按照先右孩子后左孩子的顺序;入栈2的时候按照先左孩子后右孩子的顺序;
当两个栈都为空时,循环结束;
代码如下:
package NodeList;
import java.util.ArrayList;
import java.util.Stack;
/**
* 按照之字型打印二叉树
* @Author: AnNing
* @Description:
* @Date: Create in 15:51 2019/7/19
*/
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
public static ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
//空值的判断
if (pRoot == null)
return list;
Stack<TreeNode> stack1 = new Stack();
Stack<TreeNode> stack2 = new Stack();
stack1.push(pRoot);
while (!stack1.isEmpty() || !stack2.isEmpty()) {
//当为偶数层也就是stack2进栈时,先左孩子后右孩子
ArrayList<Integer> alist = new ArrayList<Integer>();
while (!stack1.isEmpty()) {
if (stack1.peek().left != null) {
stack2.push(stack1.peek().left);
}
if (stack1.peek().right != null) {
stack2.push(stack1.peek().right);
}
alist.add(stack1.pop().val);
}
if(alist.size()!=0){
list.add(alist);
}
ArrayList<Integer> alist2 = new ArrayList<Integer>();
while (!stack2.isEmpty()) {
//当为奇数层时,也就是stack1进栈,则先右孩子后左孩子
if (stack2.peek().right != null) {
stack1.push(stack2.peek().right);
}
if (stack2.peek().left != null) {
stack1.push(stack2.peek().left);
}
alist2.add(stack2.pop().val);
}
if(alist2.size()!=0){
list.add(alist2);
}
}
return list;
}
//测试用例
public static void main(String[] args) {
TreeNode b1 = new TreeNode(8);
TreeNode b2 = new TreeNode(6);
TreeNode b3 = new TreeNode(10);
TreeNode b4 = new TreeNode(5);
TreeNode b5 = new TreeNode(7);
TreeNode b6 = new TreeNode(9);
TreeNode b7 = new TreeNode(11);
b1.left = b2;
b1.right = b3;
b2.left = b4;
b2.right = b5;
b3.left = b6;
b3.right = b7;
ArrayList list = Print(b1);
System.out.println(list);
}
}