题目来源:
https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
题目描述:
代码如下:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> list = new LinkedList<>();
Queue<TreeNode> queue = new LinkedList<>();
if(root==null) {
return list;
}
queue.add(root);
while(!queue.isEmpty()) {
List<Integer> list1 = new LinkedList<>();
int len = queue.size();
for(int i=0;i<len;i++) {
TreeNode node = queue.poll();
list1.add(node.val);
if(node.left!=null) {
queue.add(node.left);
}
if(node.right!=null) {
queue.add(node.right);
}
}
list.add(list1);
}
return list;
}
}