https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
给你一个二叉树,请你返回其按 层序遍历 得到的节点值。 (即逐层地,从左到右访问所有节点)
示例:
二叉树:[3,9,20,null,null,15,7]
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[9,20],
[15,7]
]
代码:
/**
* 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>> lists = new ArrayList<>();
if(root==null)
return lists;
List<TreeNode> nodes = new ArrayList<>();
nodes.add(root);
while (!nodes.isEmpty()){
int size = nodes.size();
List<Integer> list = new ArrayList<>();
for(int i=0; i<size; i++){
TreeNode remove = nodes.remove(0);
list.add(remove.val);
if(remove.left!=null){
nodes.add(remove.left);
}
if(remove.right!=null){
nodes.add(remove.right);
}
}
lists.add(list);
}
return lists;
}
}