two lines of Python solution, using recursion


  • 1
    def maxDepth(self, root):
        if root is None: return 0
        return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1
    

Log in to reply
 

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