README.md

title	subtitle	date	lastmod	draft	author	authorLink	description	license	images	tags	categories	featuredImage	featuredImagePreview	hiddenFromHomePage	hiddenFromSearch	twemoji	lightgallery	ruby	fraction	fontawesome	linkToMarkdown	rssFullText	toc	code	math	mapbox	share	comment	library	seo
0104.Maximum Depth of Binary Tree	https://leetcode.com/problems/maximum-depth-of-binary-tree/description/	2023-11-09 16:49:00 +0800	2023-11-09 16:49:00 +0800	false	Kimi.Tsai	https://kimi0230.github.io/	0104.Maximum-Depth-of-Binary-Tree			LeetCode Go Easy LEETCODETITLE	LeetCode			false	false	false	true	true	true	true	false	false	enable auto true true	copy maxShownLines true 200	enable		enable true	enable true	css js	images

0104.Maximum Depth of Binary Tree

題目

Given the root 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.

Example 1:

Input: root = [3,9,20,null,null,15,7] Output: 3 Example 2:

Input: root = [1,null,2] Output: 2

Constraints:

The number of nodes in the tree is in the range [0, 104]. -100 <= Node.val <= 100

Accepted 2.7M Submissions 3.6M Acceptance Rate 74.7%

題目大意

解題思路

Big O

時間複雜 : 空間複雜 :

來源

• https://leetcode.com/problems/maximum-depth-of-binary-tree/description/
• https://leetcode.cn/problems/maximum-depth-of-binary-tree/description/

解答

https://github.com/kimi0230/LeetcodeGolang/blob/master/Leetcode/0104.Maximum-Depth-of-Binary-Tree/main.go

Benchmark