a) Draw a single binary tree that gave the following traversals:

Inorder: T N C K V A S M W Q B R L

Postorder: T C N V S A W M B Q L R K

b) Assume that the binary tree from the above part (a) of this question is stored in an array-list as a complete binary tree as discussed in class. Specify the contents of such an array-list for this tree.