@prankur can we do in this manner, first find the middle of the array and make it as a root, and call recursively from 0 to mid-1 for left subtree and mid+1 to len-1 for right subtree..?
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
