inoeder traversal is given 1 2 3 4 5 6 7 8 9 in preorder traversal root come fist , then left and then right. see the option a. 1 6 3 2 7 8 4 9
1 is root at left there is 6 , sine left child must be smaller than root in this way none of options are satisfying this b. 6 7 3 8 1 9 2 7 6 is roor but 7 is greater c, 2 4 6 8 1 3 5 7 d. 1 3 5 7 2 4 6 8 i think the is some fault in the question it should post order to find On Sun, Aug 7, 2011 at 11:38 AM, ankit sambyal <ankitsamb...@gmail.com>wrote: > @coder : Cud u plz explain the approach for question 9 ?? > > -- > 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.
