题目:
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 TreeNode(object):
def __init__(self, x):self.val = x
self.left = None
self.right = None
class Solution(object):
def maxDepth(self, root):
"""
:type root: TreeNode
:rtype: int
"""
if root == None:
return 0
leftdeepth = self.maxDepth(root.left)
rightdeepth = self.maxDepth(root.right)
return max(leftdeepth,rightdeepth)+1
笔记:
如果结点为空,则深度为0;否则,至少有一层(自身),返回时加1;
递归的思想:只看根节点,递归求出左子树深度和右子树深度,取最大的一个,再加上根节点自身的深度1,得到最终树的深度。