Find the minimum total sum of distances between paired nodes in an unweighted tree
I am a beginner learning algorithms and currently working on a problem about finding the total sum of shortest distances in an unweighted tree. Here’s the specific scenario: