Maximum Depth of Binary Tree LeetCode solution in Python

1
# Runtime: 47 ms (Top 88.16%) | Memory: 16.3 MB (Top 23.73%)
2
class Solution(object):
3
    def maxDepth(self, root):
4
        """
5
        :type root: TreeNode
6
        :rtype: int
7
        """
8
        result = 0
9
        depths = []
10
        self.handler(root, result, depths)
11
        return max(depths)
12

13
    def handler(self, root, result, depths):
14
        if root:
15
            result += 1
16
            self.handler(root.left, result, depths)
17
            self.handler(root.right, result, depths)
18
        else:
19
            depths.append(result)