Easy 104题 Maximum Depth of Binary Tree

最新推荐文章于 2019-05-26 15:11:02 发布
最新推荐文章于 2019-05-26 15:11:02 发布
阅读量262 收藏
点赞数
分类专栏： leetcode easy
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/brenda_zhao/article/details/52075840
版权
leetcode easy 专栏收录该内容
46 篇文章 0 订阅 ¥9.90 ¥99.00
订阅专栏
给定一棵二叉树，找到其最大深度。最大深度是从根节点到最远叶子节点的最长路径上的节点数。本文介绍了使用深度优先搜索（DFS）和广度优先搜索（BFS）两种方法来解决此问题，并探讨了它们的时间复杂度和优劣。
摘要由CSDN通过智能技术生成

问题：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.

又是一道有思路的题，直接写出答案，但是由于太不考虑复杂度了，报了time limited的错，改一下就好，但同样不是最优美的代码，看了discuss，发现有一行解决的！

以下这个代码的思路是DFS的，深度遍历。。。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Sol
了解本专栏 订阅专栏 解锁全文
brenda_zhao
关注
专栏目录
订阅专栏
Easy 339题 Nested List Weight S
brenda_zhao的博客
10-20 379
Question: Solution: DFS: /** * // This is the interface that allows for creating nested lists. * // You should not implement it, or speculate about its implementation * public interface Nest
LeetCode104：Maximum Depth of Binary Tree
卷卷萌的博客
11-19 216
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 oj 104. Maximum Depth of Binary Tree(DFS||BFS)
Tristeza的博客
09-29 545
104. Maximum Depth of Binary Tree   Question Editorial Solution  My Submissions Total Accepted: 179819Total Submissions: 361510Difficulty: Easy Given a binary tree, find
104. Maximum Depth of Binary Tree [easy] (Python)
Coder_Orz的博客
05-07 6278
题目链接https://leetcode.com/problems/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 nod
Leetcode----104. Maximum Depth of Binary Tree(easy)
Txiaomiao的博客
02-26 704
题目：点击打开链接 Python 版一： # Definition for a binary tree node # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solu
LeetCode 104. Maximum Depth of Binary Tree
温迪今天刷题了吗
02-02 252
LeetCode 104. Maximum Depth of Binary Tree (Easy) 主要知识点：树、BFS、DFS、递归、迭代；优先级：5
LeetCode 104. Maximum Depth of Binary Tree（二叉树）
da_kao_la的博客
05-26 113
题目来源：https://leetcode.com/problems/maximum-depth-of-binary-tree/ 问题描述 104.Maximum Depth of Binary Tree Easy Given a binary tree, find its maximum depth. The maximum depth is the number of nodes ...
Easy 67题 Add Binary
brenda_zhao的博客
10-06 365
Question: Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". Solution: public class Solution { public String addBinary(St
Easy 170题 Two Sum III - Data structure design
brenda_zhao的博客
10-20 331
Question: Design and implement a TwoSum class. It should support the following operations: add and find. add - Add the number to an internal data structure. find - Find if there exist
Easy 168题 Excel Sheet Column Title
brenda_zhao的博客
08-06 293
问题：Given a positive integer, return its corresponding column title as appear in an Excel sheet. For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 -> AB 和上道题类似10
Easy 205题 Isomorphic Strings
brenda_zhao的博客
10-20 270
Question: Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be rep
Easy 252题 Meeting Rooms
brenda_zhao的博客
10-29 255
Question: Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si i), determine if a person could attend all meetings. For example, Given [[0, 30],[
Easy 371题 Sum of Two Integers
brenda_zhao的博客
07-28 243
题目：Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. 此题一看是完全没有思路的。。。经提示要用异或^和与&和 思路和例子看的这个，觉得写的非常好。http://blog.csdn.net/qq508618087/article/details/
Easy 283题 Move Zeroes
brenda_zhao的博客
08-05 231
题目：Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, given nums = [0, 1, 0, 3, 12], after calling
Easy 121题 Best Time to Buy and Sell Stock
brenda_zhao的博客
09-16 213
Question: Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sell one share
Easy 292题 Nim Game
brenda_zhao的博客
07-30 211
问题： You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will b
Easy 389题 Find the Difference
brenda_zhao的博客
09-14 197
Question：Given two strings s and t which consist of only lowercase letters. String t is generated by random shuffling string s and then add one more letter at a random position. Find the letter that
Easy 258题 Add Digital
brenda_zhao的博客
07-30 195
问题： Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has o
What is the correct description of a binary tree?
最新发布
05-05
A binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. The left child node contains a value less than or equal to its parent node, while the right child node contains a value greater than or equal to its parent node. The nodes in a binary tree can be traversed in different ways such as in-order, pre-order, and post-order. Binary trees are commonly used in computer science for efficient data storage, searching, and sorting algorithms.
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值