解题思路:深度优先遍历,只需要在偶数层的数每次插入链表的时候都插入头部即可,时间复杂度O(n),空间复杂度O(n)。
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) {
if (pRoot == null) {
return new ArrayList();
}
ArrayList<ArrayList<Integer>> list = new ArrayList<>();
addToList(pRoot, list, 0);
return list;
}
private void addToList(TreeNode root, ArrayList<ArrayList<Integer>> list, int hight) {
if (root == null) {
return ;
}
if (list.size() <= hight) {
list.add(new ArrayList<>());
}
//hight为奇数,表示是偶数层,因为层数是从0开始,每次都添加到头部
if ((hight & 1) != 0) {
list.get(hight).add(0, root.val);
} else {
list.get(hight).add(root.val);
}
addToList(root.left, list, hight + 1);
addToList(root.right, list, hight + 1);
}
}
解法二:除了第一种深度优先遍历(dfs),也可以广度优先遍历之外(bfs),时间复杂度也是O(n),空间复杂度O(n)
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 ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
if (pRoot == null) {
return new ArrayList();
}
ArrayList<ArrayList<Integer>> list = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(pRoot);
while (!queue.isEmpty()) {
ArrayList<Integer> inList = new ArrayList<>();
//每一层的数量
int size = queue.size();
//判断层数,从第0层开始算
int hight = list.size();
for (int i = 0 ; i < size; i++) {
TreeNode root = queue.poll();
if ((hight & 1) != 0) {
inList.add(0, root.val);
} else {
inList.add(root.val);
}
if (root.left != null) {
queue.offer(root.left);
}
if (root.right != null) {
queue.offer(root.right);
}
}
list.add(inList);
}
return list;
}
}