title: how to write a recursive function that would return the minimum values in a BST?
body: <p>I am trying to write a recursive fucntion that will return the 
  minimum value in a binary search tree.</p>
  
  <pre><code>int RecursiveFindMin(Tree t) {
    if (t==NULL)
      return -1;
    else {
      if (t!=NULL)
          RecursiveFindMin(t-&gt;left);
    }
  
    return t-&gt;val;   
  }
  </code></pre>
  
  <p>I expect to get the minimum value in the BST </p>
  
  <p>Instead, I am getting the second smallest result, most of the time!
  I am not very good at recursive functions and I would appreciate the 
  help!</p>