Open
Conversation
mamo3gr
reviewed
Feb 27, 2026
| - 片方が null ノードの場合、そこでマージ作業はストップできる | ||
| - null じゃないほうの木を返せばいい | ||
| - ノード数をn1, n2とすると | ||
| - 時間計算量は O(min(n1, n2)) |
There was a problem hiding this comment.
戻り値（成果物）の一部として入力の木（の一部）を使うのであればこうなりますね。そうでなければ max になりそうですね。
Owner
Author
There was a problem hiding this comment.
ありがとうございます。
そうですね、木のコピーをする場合は大きい方の木を走査することになるので max になります。
|
入力と異なるインスタンスを生成して返すパターンも検討すると、学びがより深まると思いました。 |
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.
今回の問題
Merge Two Binary Trees - LeetCode
使用言語
Go
次に解く問題
Convert Sorted Array to Binary Search Tree - LeetCode