LeetCode----Maximum Depth of Binary Tree

来源:转载

Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

分析:

递归,每次返回最大的子树长度加1。

代码:

class Solution(object): def maxDepth(self, root):""":type root: TreeNode:rtype: int"""if not root: return 0return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))



分享给朋友:
您可能感兴趣的文章:
随机阅读: