are you asking for BST or simple BT. what are the conditions you want to follow if simple BT
On Jul 26, 12:59 am, AlgoBoy <manjunath.n...@gmail.com> wrote: > Does anyone know how to merge two binary trees in O(n logn logn) > complexity.. > intiutive solution is to flatten both the trees (by inorder > traversal ) and then construct a new one... > but how to do this efficiently in O(n logn logn)..pls help -- 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.
