102. 二叉树的层序遍历

# 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: TreeNode) -> List[List[int]]:
        result=[]
        def my(deepth,tree):

            if tree!=None:
                if len(result)<deepth+1:
                    result.append([])
                result[deepth].append(tree.val)
                my(deepth+1, tree.left)
                my(deepth+1, tree.right)
        my(0,root)
        return result
            
# 一遍遍历二叉树 一遍记录深度