it's a common problem in CS/Data Structures/Graph Theory to recover a tree (or even binary tree) uniquely from a given set of inorder, preorder or postorder traversals. There is no method in general to find a unique solution from one type of traversal alone for arbitrary trees (or even binary tre...