博客域名:
http://www.xnerv.wang
原题页面: https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/
题目类型:
难度评价:★
本文地址: http://blog.csdn.net/nerv3x3/article/details/3465897
原题页面: https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/
题目类型:
难度评价:★
本文地址: http://blog.csdn.net/nerv3x3/article/details/3465897
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.
计算二叉树的最大深度。
class Solution:
def recurMaxDepth(self, root, depth):
if None == root:
return 0
elif None == root.left and None == root.right:
return 1
left_depth = (self.recurMaxDepth(root.left, depth) if None != root.left else 0)
right_depth = (self.recurMaxDepth(root.right, depth) if None != root.right else 0)
# warn: a node just have a child, a node have two child, their height calculation method are different.
if left_depth > 0 and right_depth > 0:
return max(left_depth, right_depth) + 1;
elif left_depth > 0:
return left_depth + 1
else: # right_depth > 0, or (left_depth == 0 and right_depth == 0)
return right_depth + 1
# @param root, a tree node
# @return an integer
def maxDepth(self, root):
return self.recurMaxDepth(root, 0)