On May 14, 9:46 pm, Yalla Sridhar <[email protected]> wrote: > @atul linked list can be converted to array with O(n) both space @ time > overhead. then tree can be built in O(n) >
This is true but is not the simplest solution. As pointed out earlier by me and also Divya Jain the best solution is to build the tree bottom up. Regards, Ralph Boland -- 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.
