LeetCode_Maximum Depth of Binary Tree

最新推荐文章于 2021-12-01 10:33:50 发布

shengno1

最新推荐文章于 2021-12-01 10:33:50 发布

阅读量976

点赞数

分类专栏： Something_Interesting Leetcode Algorithms C++ 文章标签： C++ algorithm leetcode 算法

本文链接：https://blog.csdn.net/sheng_ai/article/details/46693447

版权

Something_Interesting 同时被 3 个专栏收录

174 篇文章 0 订阅

订阅专栏

C++

88 篇文章 0 订阅

订阅专栏

Algorithms

47 篇文章 0 订阅

订阅专栏

一.题目

Maximum Depth of Binary Tree

Total Accepted: 70693 Total Submissions: 156776 My Submissions

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.

Show Tags

Have you met this question in a real interview?

Yes

Discuss

二.解题技巧

这道题和Minimum Depth of Binary Tree类似，只不过这个是求最大深度的，解法也和Minimum Depth of Binary Tree一样，都是对二叉树进行递归，然后将子树的最大深度进行返回，最终得到这个树的最大深度。

这个方法的时间复杂度为O(n),空间复杂都为O(logn)。

三.实现代码

#include <iostream>

/**
* Definition for a binary tree node.
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/


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;
        }

        int Result = 1;
        int Left = maxDepth(root->left);
        int Right = maxDepth(root->right);

        if (Left * Right)
        {
            Result += Left < Right? Right : Left;
        }
        else
        {
            Result += Right + Left;
        }

        return Result;
    }
};