111. Minimum Depth of Binary Tree#21
Open
miyataka wants to merge 1 commit into
Open
Conversation
miyataka
changed the title
jjysogfy
reviewed
Jun 28, 2026
| // スタックオーバーフローになるかを検討するために，ざっくり計算量を見積もる． | ||
| // nodeの数は, 0 <= N <= 10^5 | ||
| // Go言語だと，スタックメモリは1GB程度だったはず．あとで再確認する． | ||
| // 10^9 Byteなので，一つのスタックが10^3程度までならギリ収まりそう．スタックオーバーフローを気にしたくはないので，ループで書く |
There was a problem hiding this comment.
この問題だと、スタックフレームは1000Bより十分小さい気がします。レビューコメントを見ていると、100B程度で見積もることが多い印象です。
気にしたくないのでループで書くという選択には共感します。
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
2 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/minimum-depth-of-binary-tree