hi Juna,
well, first of all
you should have some Nodes ready.
Then, I assume you have, say, a variable called
rootBinarySearchTree, with your root Node as element, and
of type BinarySeachTree. If not, then create one.
Next, have you tested: rootBinaryTree.printInorder()?
Did it indeed print out the Node tree, in inorder sequence?
If so, then notice the recursion that is being used here.
When the 'leftmost' leaf has been printed, the method has finished,
and so it returns to the calling method, which is that of the parent Node.
So, in effect, you do not have to do anything special, the recursion
takes care of it all.
A handy way is always to put some println()'s at strategic places,
so that you can follow what is going on. For instance,
So, try this out and see if you can follow what is going on.
Greetz,
Piet