How we can build a tree with only one traversal ..i think to build a
tree atlesat two traversal required e.g
N
/ \
N N
/ \ / \
N L N L
/ \ / \
N N N N
so preorder is given by NNNNNLNNNNL
Therefore, following combination can uniquely identify a tree.
Inorder and Preorder.
Inorder and Postorder.
Inorder and Level-order.
And following do not.
Postorder and Preorder.
Preorder and Level-order.
Postorder and Level-order.
This is Very important Question Asked In Amazon Please Have a Closer
look at Question... & Please let me know any solution exist....
Thanks & Regards
Shashank Mani
--
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.
