解法
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
if(root==null){
return new ArrayList();
}
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
List<List<Integer>> result = new ArrayList<>();
while(!queue.isEmpty()){
int size = queue.size();
List<Integer> list = new ArrayList<>();
for(int i= 0;i<size;i++){
TreeNode num = queue.poll();
list.add(num.val);
if(num.left!=null){
queue.add(num.left);
}
if(num.right!=null){
queue.add(num.right);
}
}
result.add(list);
}
return result;
}
}
参考:
- https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/solution/mian-shi-ti-32-ii-cong-shang-dao-xia-da-yin-er-c-5/
- https://blog.algomooc.com/032.html#%E4%B8%80%E3%80%81%E9%A2%98%E7%9B%AE%E6%8F%8F%E8%BF%B0