Hi, I'm familiar with tree traversal alogirthms, post,pre and in-order. If you give me a tree I can print out the specified traversal of that tree. However, one thing I can't do is build a tree from a given output. For example, on my last test, my prof gave me this Question: A pre-order of a binary tree produced: ADFGHKLPQRWZ A post order traversal of the same tree produced: GFHKDLAWRQPZ Draw the binary tree. How do you build a tree using two given traversal outputs?