Hi, I have to implement this:
Say I am given a text,
why am fish, !
why do swim
I am to produce the following output using binary search tree.
Ok. My question. If i were to use the comparable interface, i do not need to use the euler's rule to traverse through the tree to print out the nodes in alphabetical order, right? So, how do i print it out?