if BST contains integers then sort the postorder traversal which will give you inorder traversal...
On Jun 30, 6:27 pm, "oppilas ." <[email protected]> wrote: > Is it possible to create a binary search tree (not binary tree) from post > order traversal only? > If give, how and if not please give reason/counter examples. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
