@Juver..doesnt it require the parent information ? What if the data structure has only left and right pointers.
On Fri, Jan 21, 2011 at 8:41 PM, juver++ <[email protected]> wrote: > This question was posted some time ago. > One solution is - start from the largest element (which is the righmost one > in the tree). > Then apply algorithm of searchin node's predecessor. It takes O(k) time to > find k-th largest/smallest number. > > -- > 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. > -- S.Nishaanth, Computer Science and engineering, IIT Madras. -- 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.
