Given a binary tree, find its maximum depth.<\/p>\n
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.<\/p>\n
Note:<\/strong>\u00a0A leaf is a node with no children.<\/p>\n Example:<\/strong><\/p>\n Given binary tree\u00a0 return its depth = 3.<\/p>\n Python<\/strong><\/p>\n[3,9,20,null,null,15,7]<\/code>,<\/p>\n 3\r\n \/ \\\r\n 9 20\r\n \/ \\\r\n 15 7<\/pre>\n
\r\n# Definition for a binary tree node.\r\n# class TreeNode(object):\r\n# def __init__(self, x):\r\n# self.val = x\r\n# self.left = None\r\n# self.right = None\r\n\r\nclass Solution(object):\r\n def maxDepth(self, root):\r\n """\r\n :type root: TreeNode\r\n :rtype: int\r\n """\r\n try:\r\n return max(self.maxDepth(root.left), self.maxDepth(root.right))+1\r\n except:\r\n return 0\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"