标签:
一、前言
对于这类抽象问题还有self用法,还要多做多练习,此题是参考其他答案所做。
二、题104 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.
# Definition for a binary tree 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 return max(self.maxDepth(root.left),self.maxDepth(root.right))+1
思路:分别遍历根节点的左右子树(p.s.根节点是相对而言的,不只是最初的根节点),遍历一层,加一,比较左右结果大小,最后结果再加一。
不知道说的对不对,如有误,以后了解更透彻了再更正。
Leetcode刷题记录[python]——104 Maximum Depth of Binary Tree
标签:
原文地址:http://www.cnblogs.com/Myoungs/p/5509695.html