Leetcode刷题记录——107. 二叉树的层次遍历 II

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:

    def __init__(self):
        self.res = []
        self.length = 0
    def levelOrderBottom(self, root: TreeNode) -> List[List[int]]:
        self.func(root,1)
        return self.res[::-1]

    def func(self,root,depth):
        if root == None:
            return None
        if depth > self.length:
            tempres = [root.val]
            self.res.append(tempres)
            self.length += 1
        elif depth <= self.length:
            self.res[depth-1].append(root.val)
        self.func(root.left,depth+1)
        self.func(root.right,depth+1)