从上到下,从左到右,返回一层列表
参考:剑指 Offer 32 - I. 从上到下打印二叉树
class Solution {
public int[] levelOrder(TreeNode root) {
if (root == null) {
return new int[0];
}
List<Integer> list = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
int num = queue.size();
for (int i = 0; i < num; i++) {
TreeNode treeNode = queue.poll();
list.add(treeNode.val);
if (treeNode.left != null)
queue.offer(treeNode.left);
if (treeNode.right != null)
queue.offer(treeNode.right);
}
}
int[] result = new int[list.size()];
int i = 0;
for (Integer val : list) {
result[i++] = val;
}
return result;
}
}
从上到下,从左到右,返回两层列表
《剑指offer》系列 把二叉树打印成多行(Java)
从下到上,从左到右,返回两层列表
题目:107. 二叉树的层序遍历 II
class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> list = new ArrayList<List<Integer>>();
if (root == null)
return list;
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
int num = queue.size();
List<Integer> list1 = new ArrayList<>();
for(int i=0; i<num; i++){
TreeNode treeNode = queue.poll();
list1.add(treeNode.val);
if (treeNode.left != null)
queue.offer(treeNode.left);
if (treeNode.right != null)
queue.offer(treeNode.right);
}
list.add(list1);
}
Collections.reverse(list);
return list;
}
}
之字形打印
参考:《剑指offer》系列 按之字形顺序打印二叉树(Java)