title: Remove the minimum value in a binary search tree
body: <p>I understand the algorithms but I am not sure how to put it into actual codes. Please help! And also please explain in details. I really want to understand this besides just copying down the answer.  ;)</p>
  
  <p>Here are my codes:</p>
  
  <pre><code> public boolean getLeftChild(){
      Node insertNode = root;
      while(insertNode!=null){
          insertNode = insertNode.left;
      }
      return true;
  }
  public Boolean removeMin(){
      Node insertNode = root;
      Node parentNode =root;
  
          if (insertNode.left ==null){
              insertNode.right = parentNode;
              insertNode = null;
  
          }else if (getLeftChild() ==true &amp;&amp; insertNode.right != null){
              insertNode.left = null;
          }else{
              parentNode.left = insertNode.right;
  
      }
          return true;
  }
  </code></pre>