Draw a (single) binary tree T, such that

   Each internal node of T stores a single character

   A preorder traversal of T yields EXAMFUN

   An inorder traversal of T yields MAFXUEN


Write Solution  Below this:
-----------------------------------------------------------

Might Try:
                     E
                  /     \
                X         F
              /   \      /  \
             A     M    U    N

Solves Pre-order, but fails on in-order

Preorder of EXAMFUN mandates E be the root
Inorder of MAFXUEN mandates M be the leftmost leaf


Next try:
                   E
                  /  
                X    
              /   \  
             A     F 
            /     / \
           M     U   N

Fails again on in-order, try again

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


And there you have it.