$8.(1$ pts$)$ Tree traversal

Consider a binary tree $($note: not a BST$!),$ if given a preorder traver$-$

sal and a postorder traversal of such a tree:

Is this a unique binary tree or are there multiple ways to construct a binary tree that would result in the same preorder and postorder traversals as well?

If yes, justify your answer. If no$,$ write no and provide$/$draw a counter example $($i$.$e$.,$ two different binary trees have the same preorder and postorder traversals as each other$).$