题目描述
思路:层次遍历
具体代码
class Solution {
public static List<List<Integer>> levelOrder(TreeNode root) {
LinkedList<TreeNode> list = new LinkedList<>();
List<List<Integer>> res = new ArrayList<>();
if(root != null) list.add(root);
while(!list.isEmpty()) {
List<Integer> tmp = new ArrayList<>();
for(int i = list.size(); i > 0; i--) {
TreeNode node = list.poll();
tmp.add(node.val);
if(node.left != null) list.add(node.left);
if(node.right != null) list.add(node.right);
}
res.add(tmp);
}
return res;
}
}