Got past 2 interviews and made it to the final round couldn't solve this question:

Given tree find the node that has minimum distance to all the other nodes

ex.
input :

Output: 3

ex:
Output:3

After struggling through it. I was told to stop and then given a probability question

Anyone know how to do this?