Suppose we are given the outputs of the preorder and inorder traversals of the nodes of a binary tree. Can the binary tree structure be constructed from these outputs? If yes, explain how. If no, explain why not. (Note: The binary tree to be constructed is not restricted to be a binary search tree.)