a$.$ Draw a single binary tree $T$ such that each internal node of $T$ stores a single character and a pre$-$order traversal of T yields EXAMORLUV and who's in$-$order traversal of T yields MAOXRLEVU

$[3$M$]$

b$.$ What is the post$-$order traversal of this tree.

$2M$