Available question text
Given two trees, choose one vertex from each and add an edge so the resulting tree's diameter is as small as possible. Key insight: compute each tree's diameter and center/radius — the optimal connection is between centers and the minimum possible diameter is max(d1, d2, ceil(d1/2)+1+ceil(d2/2)).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Microsoft
Leetcode 3203. Find Minimum Diameter After Merging Two Trees
Reported Dec 14, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source