@Divya Jain: In the algorithm I gave, please note that, the *max value in left subtree* should be *smaller than* the current node's key, which inturn should be *smaller than* the *min value in right subtree*. That way, my algorithm would return "false" for the example which you gave.
On Sun, Jul 4, 2010 at 1:46 PM, sharad kumar <sharad20073...@gmail.com>wrote: > @dheeraj > for this tree inorder is 12 14 13 > first 12 comes,it is saved in temp > now 14 comes since 14>12 so temp =14 > now when 13 comes which is less than temp hence not a bst > correct me if i wrong > > -- > 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<algogeeks%2bunsubscr...@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 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.
