4-line python solution

  • 3
    # Definition for a  binary tree node
    # class TreeNode:
    #     def __init__(self, x):
    #         self.val = x
    #         self.left = None
    #         self.right = None
    class Solution:
        # @param root, a tree node
        # @return an integer
        def maxDepth(self, root):
            def maxDepthHelper(root):
                if not root: return 0
                return max(1+maxDepthHelper(root.left), 1+maxDepthHelper(root.right))
            return maxDepthHelper(root)

  • 3

    You don't even have to define a closure. Just call maxDepth() and two lines suffice.

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.