Just a quick note to the above solution. If the tree is a binary search tree and you are going to put it in an array after an inorder traversal, the elements will be sorted, so to find the k'th max just access the n-k'th element
-- 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.
