Will not any self balancing BST like RB Tree, AVL Tree etc. work for this case?
Anurag Sharma On Sun, Jun 20, 2010 at 4:15 PM, sharad <[email protected]> wrote: > Given an incoming stream of sorted numbers construct a binary search > tree. At each stage, you should have a nearly balanced tree. > > -- > 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]<algogeeks%[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.
