convert bst to doubly linked list inorder and find middle element using slow and fast pointer concept........
On Tue, Sep 27, 2011 at 2:18 PM, Ankur Garg <[email protected]> wrote: > I was thinking of making the tree balanced with equal no of nodes in left > and right subtree > > Median will be root in this case > > > Regards > Ankur > > -- > 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. > -- 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.
