题目
给你二叉树的根节点 root ,返回其节点值的 层序遍历 。 (即逐层地,从左到右访问所有节点)。
示例 1:
输入:root = [3,9,20,null,null,15,7]
输出:[[3],[9,20],[15,7]]
示例 2:
输入:root = [1]
输出:[[1]]
示例 3:
输入:root = []
输出:[]
题解
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode() {}
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> resultList = new ArrayList<>();
if (null == root) {
return null;
}
LinkedList<TreeNode> levelList = new LinkedList<>();
levelList.offer(root);
while (!levelList.isEmpty()) {
List<Integer> levelResultList = new ArrayList<>();
int currentSize = levelList.size();
for (int i = 1; i < currentSize; i++) {
TreeNode node = levelList.poll();
levelResultList.add(node.val);
if (null != node.left) {
levelList.offer(node.left);
}
if (null != node.right) {
levelList.offer(node.right);
}
}
resultList.add(levelResultList);
}
return resultList;
}