刷题-Maximum Depth of Binary Tree

最新推荐文章于 2025-12-20 09:26:15 发布

原创最新推荐文章于 2025-12-20 09:26:15 发布 · 501 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python #java

本文介绍了一种使用递归方法来确定二叉树的最大深度的方法。通过遍历二叉树的左右子节点，计算从根节点到最远叶子节点的最长路径上的节点数。

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.

递归

java解法：

public class Solution {

public int maxDepth(TreeNode root) {
if (root==null) return 0;
int left = maxDepth(root.left);
int right = maxDepth(root.right);
return Math.max(left,right)+1;
}

}

python解法：

# 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 is None:
return 0
else:
return max(self.maxDepth(root.left),self.maxDepth(root.right))+1