title: Can we construct a full binary tree with only postorder traversal or preorder traversal?
body: <p>For example, we are provided with only post order traversal array or only pre order traversal array. Can we reconstruct the binary tree back? If we know that the binary tree is full. Moreover, if it is not, is it possible to construct the full binary if know both preorder and post order at the same time?</p>