leetcode 104. Maximum Depth of Binary Tree

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

hui1140621618

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

阅读量383

点赞数

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/hui1140621618/article/details/62883049

版权

leetcode 专栏收录该内容

22 篇文章

订阅专栏

题目：

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.

找到一棵二叉树的最大深度

思路：采用递归的方法，分别找到左子树和右子树的最大深度，取其中一个较大的深度加上1，即为整棵二叉树的最大深度。

代码AC：

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

hui1140621618

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
分享

复制链接

分享到 QQ

分享到新浪微博

扫一扫
举报

举报

专栏目录

LeetCode --- 104. Maximum Depth of Binary Tree 解题报告

杨鑫newlife的专栏

06-19

299

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. Note:A leaf is a node with no childre...

[LeetCode]--104. Maximum Depth of Binary Tree

杜鲁门的博客

10-04

614

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.二话不说，递归求解，一次通过。public int maxDepth(TreeNode

参与评论您还未登录，请先登录后发表或查看评论

LeetCode104.Maximum Depth of Binary Tree

qq_41704019的博客

07-16

259

Leetcode 104. Maximum Depth of Binary Tree

SnailTyan

09-18

342

文章作者：Tyan 博客：noahsnail.com  |  优快云  |  简书 1. Description 2. Solution Version 1 /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *l...

LeetCode 104. Maximum Depth of Binary Tree

qq_43352073的博客

12-09

229

闯关leetcode——104. Maximum Depth of Binary Tree

方亮的专栏

10-15

592

最简单的办法就是遍历这棵树，对于每个节点，返回它的最长子树的深度+1。对于nullptr，返回0。这种题都是递归思想。

leetcode 104. Maximum Depth of Binary Tree 解法 python

CSerwangjun的博客

10-30

483

一.问题描述 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. Note:A leaf is a node with no...

leetcode104. Maximum Depth of Binary Tree

中华小当家的博客

03-16

208

标题 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. Note: A leaf is a node with no childr...

LeetCode104. Maximum Depth of Binary Tree

叶卡捷琳堡的博客

11-09

277

【代码】LeetCode104. Maximum Depth of Binary Tree。

LeetCode 104. Maximum Depth of Binary Tree二叉树的最大深度（Java）

qq_41878358的博客

02-06

255

题目： 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. Note: A leaf is a node with no child...

Leetcode104. Maximum Depth of Binary Tree

magic_jiayu的博客

02-12

222

Leetcode104. Maximum Depth of Binary Tree 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 nod...

Leetcode 104. Maximum Depth of Binary Tree (python+cpp)

qq_37821701的博客

06-24

287

Leetcode 104. Maximum Depth of Binary Tree题目解析：题目解析：题目很简单，不多说，树的基本用法还是要记录一下一板一眼的python代码如下： class Solution: def maxDepth(self, root: TreeNode) -> int: if not root: return 0 left_depth = right_depth = 0 if roo

【LeetCode 面试经典150题】104. Maximum Depth of Binary Tree 二叉树的最大深度

qq_43513394的博客

01-17

373

Given the of a binary tree, return its maximum depth.A binary tree’s maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.给定一个二叉树的，返回其最大深度。二叉树的最大深度是从根节点到最远叶子节点的最长路径上的节点数。输入: = [3,9,20,null,null,15,

LeetCode-104 Maximum Depth of Binary Tree | 二叉树的最大深度

weixin_43265151的博客

07-28

310

LeetCode-104 Maximum Depth of Binary Tree | 二叉树的最大深度题目描述给定一个二叉树，找出其最大深度。二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。说明: 叶子节点是指没有子节点的节点。示例：给定二叉树 [3,9,20,null,null,15,7]， 3 / 9 20 / 15 7 返回它的最大深度 3 。题目分析这是一个简单的二叉树问题，可以通过深度优先搜索递归完成递归中对每个当前结点进行判断，如果当前结点不为空，则继

leetcode刷题笔记(Golang)--111. Minimum Depth of Binary Tree

weixin_44555304的博客

02-19

180

111. Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. Note: ...

leetcode 82. Remove Duplicates from Sorted List II

hui1140621618的博客

03-16

462

题目： Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. 要求把链表中所有重复

leetcode 110.Balanced Binary Tree

hui1140621618的博客

03-17

365

题目: Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never

leetcode 136. Single Number

hui1140621618的博客

03-15

345

题目：Given an array of integers, every element appears twice except for one. Find that single one. 找到在数组中只出现过一次的数，要求线性时间，同时空间复杂度为O(1)。思路：将数组中的元素从小到大进行排列，然后比较相邻的元素，判断相邻的元素是否相等。实现代码：另

``` #define MAX(a, b) ((b) > (a) ? (b) : (a)) int maxDepth(struct TreeNode* root) { if (root == NULL) { return 0; } int l_depth = maxDepth(root->left); int r_depth = maxDepth(root->right); return MAX(l_depth, r_depth) + 1; } 作者：灵茶山艾府链接：https://leetcode.cn/problems/maximum-depth-of-binary-tree/solutions/2010612/kan-wan-zhe-ge-shi-pin-rang-ni-dui-di-gu-44uz/ 来源：力扣（LeetCode）著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。```为什么这个方法叫做自底向上