actually the questn should go like this.....wud that be good /optimised with space because we can use more storages for a tree without freeing them....
On Thu, Aug 4, 2011 at 10:09 AM, rajeev bharshetty <[email protected]> wrote: > Since you are maintaining two different data structures ,one for the old > tree and the other for new tree . I think this isn't considered in-place > algorithm . The algorithm to be in-place should not use any additional data > structures . > Correct me if I am wrong . > On Thu, Aug 4, 2011 at 2:52 AM, Gaurav Popli <[email protected]> wrote: >> >> good quesn.....i also want to know....just in case >> >> On Thu, Aug 4, 2011 at 2:50 AM, Anurag Narain <[email protected]> >> wrote: >> > suppose there is a binary tree and i am creating another tree which is >> > same >> > as the previous one. >> > but while creating the new tree i am freeing the nodes of my old >> > tree(i.e., >> > i create one node in new tree and delete the corresponding node in old >> > tree >> > and continue the process till the new tree is formed which is same as >> > old >> > tree but the old tree now does not exist) >> > >> > >> > would this conversion be considered in-place?? >> > >> > -- >> > 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. >> > > > > -- > Regards > Rajeev N B > > "Winners Don't do Different things , they do things Differently" > > -- > 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.
