Open
Conversation
liquo-rice
reviewed
Nov 26, 2024
| class Solution: | ||
| def maxDepth(self, root: Optional[TreeNode]) -> int: | ||
| tree_nodes = deque([root]) | ||
| depth = 0 |
oda
reviewed
Nov 26, 2024
|
|
||
| BFS。 | ||
| 木がバランスしていても空間計算量が O(n)のため、今回のケースだと DFS のほうがより効率的になる可能性が高い。 | ||
|
|
There was a problem hiding this comment.
BFS はいくつか書き方があるんですが、階層ごとにしたいときには、私は List 2つで作るのが好みです。
Yusan1234/arai60#1 (comment)
https://discord.com/channels/1084280443945353267/1201211204547383386/1219179255615717399
一つの変数に、2つの違う種類のものを入れておいて、その境界を個数で管理している
データの整合性が取れているということは、読んでいる人からすると全部読み終わらないと分からない
下は関係のあるようなないような読み物です。Queue を Stack で代用する話ですね。
https://cp-algorithms.com/data_structures/stack_queue_modification.html
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
https://leetcode.com/problems/maximum-depth-of-binary-tree/description/