I don't think so. If I understand your problem well, I have a counter-example take for example - > Inorder Traversal - 1-2-3 this could mean a binary tree rooted at 2 with 2 leaf nodes 1 and 3 but this could also mean a binary tree rooted at 3 with 2 as its left child which in-turn has 1 as its left child (the only leaf node).
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. > > > -- - Saurabh Paliwal B-Tech. Comp. Science and Engg. IIT ROORKEE -- 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.
