LeetCode：Maximum Depth of Binary Tree

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

hackerzchao

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

阅读量518

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode LeetCode 文章标签： leetcode algorithm tree

本文链接：https://blog.youkuaiyun.com/hnuzengchao/article/details/41978303

LeetCode 同时被 2 个专栏收录

48 篇文章

订阅专栏

LeetCode

48 篇文章

订阅专栏

本文探讨了如何通过递归算法来计算给定二叉树的最大深度，即从根节点到最远叶子节点的最长路径长度。

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.

// Source : https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/
// Author : Chao Zeng
// Date   : 2014-12-17

/**
 * 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)
            return 0;
        else
        {
            int len1 = maxDepth (root->left) ;
            int len2 = maxDepth (root->right) ;
            return len1 > len2 ? len1 + 1 : len2 + 1;
        }
    }
};