LeetCode:maximum-depth-of-binary-tree

最新推荐文章于 2025-11-23 20:02:12 发布

原创最新推荐文章于 2025-11-23 20:02:12 发布 · 375 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

101 篇文章

订阅专栏

本文介绍了一种用于计算二叉树最大深度的算法。该算法递归地遍历二叉树的左右子树，找到从根节点到最远叶子节点的最长路径长度。

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
 * 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;
        if(root->left==NULL)
            return maxDepth(root->right)+1;
        else if(root->right==NULL)
            return maxDepth(root->left)+1;
        else
            return max(maxDepth(root->left),maxDepth(root->right))+1;
    }
};