title: Algorithm - Finding the number of pairs with diameter distance in a tree?
body: <p>I have a non-rooted bidirectional unweighted non-binary tree. I know how to find the diameter of the tree, the greatest distance between any pair of points in the tree, but I'm interested in finding the number of pairs with that max distance. Is there an algorithm to find the number of pairs with diameter distance in better than O(V^2) time, where V is the number of nodes?</p>
  
  <p>Thank you!</p>