码迷,mamicode.com
首页 > 编程语言 > 详细

[leetcode]Maximum Depth of Binary Tree @ Python

时间:2014-06-12 13:55:34      阅读:210      评论:0      收藏:0      [点我收藏+]

标签:des   style   class   blog   code   java   

原题地址:https://oj.leetcode.com/problems/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.

解题思路:求树的最大深度。使用递归,很简单。

代码:

bubuko.com,布布扣
# Definition for a  binary tree node
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    # @param root, a tree node
    # @return an integer
    def maxDepth(self, root):
        if root == None:
            return 0
        else:
            return max( self.maxDepth(root.left), self.maxDepth(root.right) ) + 1
bubuko.com,布布扣

 

[leetcode]Maximum Depth of Binary Tree @ Python,布布扣,bubuko.com

[leetcode]Maximum Depth of Binary Tree @ Python

标签:des   style   class   blog   code   java   

原文地址:http://www.cnblogs.com/zuoyuan/p/3782275.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!