Draw a binary tree T that simultaneously satisfies the follwoing:

• Each internal node of T stores a single character
• a preorder traversal of T yields EXAMFUN
• an inorder traversal of T yields MAFXUEN

HINT - Draw the tree starting with the beginning and end characters of the two character strings.