title: Algorithm finding path in an undirected tree
body: <p>Suppose I am given a undirected tree and I need to find a path(the only path) between two nodes.</p>
  
  <p>What is the best algorithm to do it.I probably could use a Dijkstra's algorithm but there a probably something better for trees.</p>
  
  <p>C++ example would be helpful but not necessary </p>
  
  <p>Thank you</p>