B-Tree- method inorder(TreeNode<E> root)
<p>I don't understand this method.</p>

<pre><code> protected void inorder(TreeNode&lt;E&gt; root) {
  if (root == null) return;
   inorder(root.left);
   System.out.print(root.element + " ");
   inorder(root.right);
}
</code></pre>

<p>When <code>current node</code> comes to last node in the tree and current.left become null, what then happened?  <code>current node</code> returns where? When that node is going to print?</p>
