[leetcode]Maximum Depth of Binary Tree @ Python

2023年3月17日 111次阅读 来源: 南郭子綦

原题地址：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.

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

代码：

# 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

 

    原文作者：南郭子綦
    原文地址: https://www.cnblogs.com/zuoyuan/p/3782275.html
    本文转自网络文章，转载此文章仅为分享知识，如有侵权，请联系博主进行删除。
点赞