Solution: Find Minimum Diameter After Merging Two Trees

Explore how to find the minimum possible diameter of a combined tree formed by connecting two given trees. Learn to apply breadth-first search twice on each tree to compute diameters efficiently, then use a formula to determine the optimal edge connection that minimizes the new diameter. This lesson teaches you to solve the problem with a clear BFS-based strategy and analyze time and space complexities.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

You are given two undirected trees: one with $n$ nodes labeled from $0$ to $n - 1$ , and another with $m$ nodes labeled from $0$ to $m - 1$ . Their structures are defined by two $2D$ integer arrays—edges1 of length $n - 1$ for the first tree, and edges2 of length $m - 1$ for the second. Each element edges1[i] = [aᵢ, bᵢ] represents an edge between nodes $aᵢ$ and $bᵢ$ in the first tree, and similarly, edges2[i] = [uᵢ, vᵢ] represents an edge in the second tree.

Your task is to connect any node from the first tree to any one node from the second tree using a single ...