思路:就是层序遍历嘛
public class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
if (root == null) {
LinkedList<List<Integer>> lists = new LinkedList<>();
return lists;
}
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
LinkedList<List<Integer>> res = new LinkedList<>();
while (!queue.isEmpty()) {
int count = queue.size();
LinkedList<Integer> integers = new LinkedList<>();
for (int i = 0; i < count; i++) {
TreeNode tmp = queue.remove();
integers.add(tmp.val);
if (tmp.left != null) queue.add(tmp.left);
if (tmp.right != null) queue.add(tmp.right);
}
res.add(integers);
}
return res;
}
}