1. Tree Traversals. a. Consider a binary tree whose traversals are given below. Reconstruct the tree. Inorder: I J B A E G D H F C Preorder: A B I J C D E G F H

b. Write recursive code that takes two strings representing the inorder and preorder traversal of a tree and rebuilds the tree. treeType buildTree (string inorder, preorder) { }