Knowing the preorder and inorder traversals of a binary tree will enable you to uniquely define the tree. The same is true for the postorder and inorder traversals. You must show the intermediate steps during the creation of unique binary trees. Otherwise you will not receive any credit. You might find it more convenient to prepare your answers on paper, capture photos, and then upload those images.

a$)$ Draw the unique binary tree that has the following preorder and inorder traversals. $(4$ points$)$

Preorder: $\backslash ($ A$,$ B$,$ C$,$ D$,$ F$,$ E$,$ G$,$ H $\backslash )$

Inorder: $\backslash ($ B$,$ A$,$ F$,$ D$,$ C$,$ G$,$ E$,$ H $\backslash )$

a$)$ Draw the unique binary tree that has the following postorder and inorder traversals. $(4$ points$)$

Preorder: $\backslash ($ B$,$ F$,$ D$,$ G$,$ H$,$ E$,$ C$,$ A $\backslash )$

Inorder: $\backslash ($ B$,$ A$,$ F$,$ D$,$ C$,$ G$,$ E$,$ H $\backslash )$