Traverse the tree inorder. Store the values in an array. Find the element in the middle of the array.
On Sun, Aug 7, 2011 at 8:57 AM, subramania jeeva <subramaniaje...@gmail.com>wrote: > 5 > /\ > 6 7 > / > 8 > > Here the centre is both 5 and 6 . we need to find both of them..:) > > > > > > > > > > Cheers > ~ Jeeva ~ > > > > > -- > 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. > -- 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.
