To print the nodes in this tree in order, you do something like:
Now we want to count instead of printing. If the count variable is outside the recursive routine just replace print with counter++ and then compare count to n. We also need a way to signal that we're done without visiting the whole tree. See if this makes sense ... totally off the top of my head and not tested ...
[ October 11, 2007: Message edited by: Stan James ]
A good question is never answered. It is not a bolt to be tightened into place but a seed to be planted and to bear more seed toward the hope of greening the landscape of the idea. John Ciardi
Joined: Jun 26, 2007
Thank you James...!
I'll try this out.
" The Art Of People Is The True Mirror Of Their Minds........! "
subject: Nth Smallest Element of a Binary Search Tree