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


Example:
                          I
                       /     \
                      M       N
                            /   \
                           O      T


Has preorder traversal of:   IMNOT
And inorder traversal of:    MIONT


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