Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Solve Problem 3203. Find Minimum Diameter After Merging Two Trees #2299

Open
threeal opened this issue Dec 24, 2024 · 0 comments · May be fixed by #2300
Open

Solve Problem 3203. Find Minimum Diameter After Merging Two Trees #2299

threeal opened this issue Dec 24, 2024 · 0 comments · May be fixed by #2300
Assignees
@threeal
Labels
feat test
Milestone
December 2024

Comments

@threeal
Copy link
Owner

threeal commented Dec 24, 2024

This issue suggests solving the problem 3203. Find Minimum Diameter After Merging Two Trees. To achieve this, we can find the diameter of both trees and determine the largest among the diameter of the first tree, the diameter of the second tree, and the sum of half the diameter of the first tree, half the diameter of the second tree, and 1.
@threeal threeal added this to the December 2024 milestone Dec 24, 2024
@threeal threeal self-assigned this Dec 24, 2024
@threeal threeal linked a pull request Dec 24, 2024 that will close this issue
Draft
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@threeal threeal

Labels
feat test
Projects
None yet
Milestone
December 2024
Development

Successfully merging a pull request may close this issue.

Solve Problem 3203. Find Minimum Diameter After Merging Two Trees threeal/leetspace
1 participant
@threeal