It depends on the structure of the tree. Is it binary search tree? What is the expected position of placing particular node in the tree? Cause the tree is complete, we know that its height is log n
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
