Constructing a binary tree from inorder and postorder traversals

[Shackman]

Homework Statement

Construct the tree from the following traversals
Preorder: EXAMFUN
Inorder: MAFXUEN

The Attempt at a Solution

E
/ \
X N
/ \
A U
/ \
M F

Correct?

Very difficult to see sorry, but E is root with left child X right child N. X has left child A right child U. A has left child M right child F.

 

[Shackman]

I am now almost positive the first tree is correct, but what about
Preorder: DBACEGF
Inorder: ABCDEFG

I have: Root is D has left child B right child E. B has left child A right child C. E has left child null right child F. F has left child G right child null.