since you know the size, you know exactly the path to the new node. Sent from Nexus one On Dec 21, 2010 11:10 PM, "mo...@ismu" <[email protected]> wrote: > > it takes O(n) and also O(n)extra space(queue) > > > On Wed, Dec 22, 2010 at 12:37 PM, Saurabh Koar <[email protected]> wrote: >> >> Find the first node whose left child is NULL or Right child is NULL >> using BFS.(As the tree is complete,all nodes before this will have two >> children).Insert at that node. >> >> -- >> 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]<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.
