title: Shortest Root to Leaf Path
body: <p>What is the easiest way, preferably using recursion, to find the shortest root-to-leaf path in a BST (Binary Search Tree).  Java prefered, pseudocode okay.</p>
  
  <p>Thanks!</p>