[LeetCode] Maximum Depth of Binary Tree

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

原创最新推荐文章于 2024-10-15 15:32:42 发布 · 408 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

144 篇文章

订阅专栏

本文介绍了一种求解二叉树最大深度的算法。通过递归方式计算左子树和右子树的最大深度，并返回较大值加一作为当前节点的最大深度。此算法适用于所有类型的二叉树。

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) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(root == NULL) return 0;
        int maxLeft = maxDepth(root->left);
        int maxRight = maxDepth(root->right);
        return (maxLeft > maxRight ? maxLeft+1 : maxRight+1);
    }
};