[LeetCode]Maximum Depth of Binary Tree

最新推荐文章于 2024-10-15 15:32:42 发布

BoilerHouseKing

最新推荐文章于 2024-10-15 15:32:42 发布

阅读量699

点赞数 1

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： LeetCode Java C++

本文链接：https://blog.youkuaiyun.com/guorudi/article/details/38351763

LeetCode 专栏收录该内容

160 篇文章

订阅专栏

本文介绍了如何通过递归算法来计算给定二叉树的最大深度。最大深度定义为从根节点到最远叶子节点的最长路径上的节点数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int maxDepth(TreeNode root) {
        if(root ==null) return 0;
        int leftDepth=maxDepth(root.left);
    	int rightDepth=maxDepth(root.right);
    	return (leftDepth>rightDepth?leftDepth:rightDepth)+2;
    }
}

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode *root) {
        if(root ==NULL) return 0;
        int leftDepth =maxDepth(root->left);
        int rightDepth =maxDepth(root->right);
        return (leftDepth>rightDepth?leftDepth:rightDepth)+1;
    }
};