python写算法题：leetcode: 102. Binary Tree Level Order Traversal

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