this is a tree traversal(depth first) problem. as for the extra space, depends on how you see it. "fifth" can be the counter and when the counter reaches 0, you have your fifth largest element
On Jan 21, 9:58 am, nagaraj N <nagaraj1...@gmail.com> wrote: > How do you find out the fifth maximum element in an binary search tree > in efficient manner without using any extra space? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
