@atul linked list can be converted to array with O(n) both space @ time overhead. then tree can be built in O(n)
On Sat, May 15, 2010 at 2:53 AM, W Karas <[email protected]> wrote: > See the definition of: > > template<typename fwd_iter> > bool build(fwd_iter p, size num_nodes) > > Within the iter subclass, within the base_avl_tree template in: > > http://wkaras.webs.com/gen_cpp/avl_tree_h.txt > > On May 2, 9:08 am, divya <[email protected]> wrote: > > u are given a sorted lnked list construct a balanced binary search > > tree from it. > > > > -- > > 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 athttp:// > 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]<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.
