Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
For example:
Given binary tree [3,9,20,null,null,15,7]
,
3
/ \
9 20
/ \
15 7
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]
Solution:
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> result = new ArrayList<>();
levelOrder(root, result, 0);
return result;
}
private void levelOrder(TreeNode root, List<List<Integer>> result, int level) {
if (root == null)
return;
if (result.size() <= level || result.get(level) == null)
result.add(level, new ArrayList<>());
result.get(level).add(root.val);
levelOrder(root.left, result, level + 1);
levelOrder(root.right, result, level + 1);
}