1. 题目说明
“之”字形打印二叉树:
输出:[[1], [3, 2], [4,5,6,7], [15,14,13,12,11,10,9,8]]
2. 解题思路
有了前面两道题的经验,我二话不说,直接找规律。先构建两个栈,第一个栈先存取头节点1,然后pop出,将其左右节点按照先左后右的节点顺序push进stack2,按照此操作进行即可。
stack1=[1] | ans=[] | stack2=[] | ||
stack1=[] | ans=[1] | stack2=[2,3] | 先左后右 | 第一层stack1 |
stack1=[7,6] | ans=[1,3] | stack2=[2] | 先右后左 | 第二层stack2 |
stack1=[7,6,5,4] | ans=[1,3,2] | stack2=[] | ||
stack1=[7,6,5] | ans=[1,3,2,4] | stack2=[8,9] | 先左后右 | 第三层stack1 |
stack1=[7,6] | ans=[1,3,2,4,5] | stack2=[8,9,10,11] | ||
stack1=[7] | ans=[1,3,2,4,5,6] | stack2=[8,9,10,11,12,13] | ||
stack1=[] | ans=[1,3,2,4,5,6,7] | stack2=[8,9,10,11,12,13,14,15] | ||
stack1=[31,30] | ans=[1,3,2,4,5,6,7,15] | stack2=[8,9,10,11,12,13,14] | 先右后左 | 第四层stack2 |
... | ... | ... | ... | ... |
规律如下:
在单数层,取出stack1的元素,添加stack2时按照先左后右;
在双数层,取出stack2的元素,添加stack1时按照先右后左;
这里利用了栈后进先出的特性。
3. 代码
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
public class ques32_2 {
public static List<List<Integer>> levelOrder2(TreeNode root) {
Queue<TreeNode> queue = new LinkedList<>();
List<List<Integer>> res = new ArrayList<>();
if(root != null) queue.add(root);
//直到队列为空为止
while(!queue.isEmpty()) {
List<Integer> tmp = new ArrayList<>();
//循环长度为当前队列的长度,即每一层的个数
for(int i = queue.size(); i > 0; i--) {
//返回并移除队列的头元素
TreeNode node = queue.poll();
tmp.add(node.val);
if(node.left != null) queue.add(node.left);
if(node.right != null) queue.add(node.right);
}
res.add(tmp);
}
return res;
}
public static void main(String[] args) {
//构建树
TreeNode a4 = new TreeNode(15);
TreeNode a5 = new TreeNode(7);
TreeNode a3 = new TreeNode(20);
a3.left = a4;
a3.right = a5;
TreeNode a2 = new TreeNode(9);
TreeNode a1 = new TreeNode(3);
a1.left = a2;
a1.right = a3;
//测试
List<List<Integer>> res = levelOrder2(a1);
for (int i = 0; i < res.size(); i++) {
for (int j = 0; j < res.get(i).size(); j++) {
System.out.println(res.get(i).get(j));
}
System.out.println();
}
}
public static class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
}