Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
java
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/*
* @param root: A Tree
* @return: Level order a list of lists of integer
*/
public List<List<Integer>> levelOrder(TreeNode root) {
// write your code here
List<List<Integer>> list = new ArrayList<>();
if (root == null) {
return list;
}
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
int num = queue.size();
List<Integer> value = new ArrayList<>();
for (int i = 0; i < num; i++) {
TreeNode node = queue.poll();
value.add(node.val);
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
}
list.add(value);
}
return list;
}
}
python
"""
Definition of TreeNode:
class TreeNode:
def __init__(self, val):
self.val = val
self.left, self.right = None, None
"""
class Solution:
"""
@param: root: A Tree
@return: Level order a list of lists of integer
"""
def levelOrder(self, root):
# write your code here
result = []
if root is None:
return result
queue = [root]
while queue:
new_q = []
result.append([n.val for n in queue])
for node in queue:
if node.left:
new_q.append(node.left)
if node.right:
new_q.append(node.right)
queue = new_q
return result