what the issue with this , while doing inorder traversal check if left and right both are null its ur leaf node else keep traversing. If i couldn't understood ur problem , please explain again.
On Sat, Mar 16, 2013 at 7:44 PM, Megha Agrawal <[email protected]>wrote: > Hello all, > > Is it possible to get leaf nodes from inorder traversal of a binary > tree(not BST)? > > -- > Thank you > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > For more options, visit https://groups.google.com/groups/opt_out. > > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/groups/opt_out.
