@all try to understand the question as usual we have to do it in min. time & space complexity ..in mean Time O(n) & space o(1) At-most just tell em after doing in-order traversal where u will store the elements either in array or in set isn'tit it will take O(n) extra space why not looks fro O(1) SPACE..IF M NOT CORRECT otherwise problem just become finding median in array which O(1) ..correct me if m wrong
@Anurag wher u will store inorder of tree Thanks Shashank -- 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.
