plz solve it according to DSA concept in C++ plz solve it fast ASAP plzplzplzzzzz. it's very urgent plz solve it asap

Is it possible to have unique re-constructed binary tree given its pre-order and postorder traversals? Justify your answer. Given the following inorder and preorder traversal reconstruct a binary tree. Inorder - 11,28,23,34,15,17,42,19 Preorder - 15,23,11,28,34,19,17,42 Also determine post order traversal of the re-constructed binary tree