And you have to use the pointer-reversing trick to traverse the tree because you don't have space for a stack.
On Sep 27, 4:52 am, anshu mishra <[email protected]> wrote: > do the inorder traversal as soon as reached at n/2th element that will be > median. -- 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.
