102. Binary Tree Level Order Traversal 二叉树级别遍历 (Medium)【Medium】

题目：

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:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def levelOrder(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        res = []
        self.dfs(root,0,res)
        return res
        
        
    def dfs(self,root,deep,res):
        if root == None:
            return res
        if len(res)<deep+1:
            res.append([])
        res[deep].append(root.val)
        self.dfs(root.left,deep+1,res)
        self.dfs(root.right,deep+1,res)