Inorder traversal will do. Can use morris inorder also. Anurag Sharma
On Tue, Jun 8, 2010 at 12:40 AM, Veer Sharma <thisisv...@rediffmail.com>wrote: > Given a Binary Search Tree, write a program to print the kth smallest > element without using any static/global variable. You can’t > pass the value k to any function also > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
