Consider binary trees that have single characters stored at each internal node

Question: Draw one binary tree that will spell out the phrase: ANUPSIDEDOWNTREE when nodes are visited in preorder, and UNPADIESDNWTOERE when visited in inorder. (Draw only one tree!) (answers.pdf).