https://leetcode.com/problems/binary-tree-level-order-traversal/description/
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] ]
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def levelOrder(self, root):
"""
:type root: TreeNode
:rtype: List[List[int]]
"""
if root == None:
return []
self.res = []
self.helper(root, 0)
return self.res
def helper(self, root, depth):
if root == None:
return
while len(self.res) < depth + 1:
self.res.append([])
self.res[depth].append(root.val)
self.helper(root.left, depth + 1)
self.helper(root.right, depth + 1)