title: printing binary search tree inorder recursively
body: <p>I have the code for printing a the contents of a binary search tree in-order (ascending) using recursion. I understand that the helper method calls on the recursive method with root as the beginning node value. But I don't understand how the recursive code works conceptually. Could anyone explain?</p>
  
  <pre><code>//ascend method that prints values in the tree in ascending order
  //recursive method below
  public void printAscending() {
      printAscending(root);
  }
  private void printAscending(Node node) {
      if(node != null) {
          printAscending(node.left);   
          System.out.println(node.data);
          printAscending(node.right);  
      }
  }
  </code></pre>