[3 points] Draw a single binary tree T such that each internal node of T stores a single character a preorder traversal of T yields ABDGHEICFJ; and a inorder traversal of T yields GDHBEIAFJC