(a) Let T be a binary tree that stores a single character in each node. Construct the unique binary tree T given that the preorder and inorder traversals of T
are as below:
preorder traversal: T E G C S R A
inorder traversal : C G S E R T A

(b) Give the postorder traversal of the tree you constructed in part (a).