Find Minimum Diameter After Merging Two Trees

Explore techniques to connect two undirected trees by adding one edge to minimize the resulting combined tree's diameter. Understand how to apply breadth-first search to find the smallest possible diameter after merging and solve the problem efficiently under given constraints.