Problem of the day
The first line of the input contains an integer, 'T,’ denoting the number of test cases.
The first line of each test case contains an integer, 'N,’ denoting the number of nodes.
The next ‘N’-1 lines of each test case contain two space-separated integers, ‘X’ and ‘Y’ separated by a single space, ‘X’ and ’Y’ denote the two nodes connected by an undirected edge.
For each test case, return the list of all such nodes such that rooting the tree on that node gives the minimum height possible.
Return all the nodes in a sorted manner.
You do not need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 10
1 <= N <= 10^5
1 <= X,Y <= N
The input edges form a tree.
Time limit: 1 sec
2
3
1 2
2 3
4
1 2
3 1
4 1
2
1
For the first test case, if we root the tree at Node 2, the height of the resultant tree is 1 which is the minimum possible height.
For the second test case, if we root the tree at Node 1, the height of the resultant tree is 1 which is the minimum possible height.
2
4
1 3
2 3
4 2
2
1 2
2 3
1 2