Is the path from u to v is diameter of the tree?

54 Views Asked by At

The diameter of a tree is the longest (simple) path in the tree. Let u be a vertex in a tree and let v be the farthest from u vertex in T. Show that the path from u to v may not be a diameter I am getting confused of how to find this?