Thanks Rohit! On Sat, May 15, 2010 at 7:13 PM, Rohit Saraf <[email protected]>wrote:
> there is something called morris inorder traversal. > credits to donald knuth > > > On 5/15/10, kaushik sur <[email protected]> wrote: > > Hi Friends > > > > I have encountered the question in sites - "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." > > > > I have tried my hands using explicit stack for inorder and keeping a > > non-static count variable. > > > > I welcome any better solution, time and space efficient. > > > > Best Regards > > Kaushik Sur > > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to [email protected]. > > To unsubscribe from this group, send email to > > [email protected]<algogeeks%[email protected]> > . > > For more options, visit this group at > > http://groups.google.com/group/algogeeks?hl=en. > > > > > > > -- > -------------------------------------------------- > Rohit Saraf > Second Year Undergraduate, > Dept. of Computer Science and Engineering > IIT Bombay > http://www.cse.iitb.ac.in/~rohitfeb14<http://www.cse.iitb.ac.in/%7Erohitfeb14> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
