Prove that in every tree, any two paths with maximum length have a node in common.

1.7k Views Asked by At

Prove that in every tree, any two paths with maximum length have a node in common. This is not true if we consider two maximal (i.e. non-extendable) paths.

What does this even mean?