Given a full binary treeT, define thereflectionofTto be the binary treeT'such that each nodevinTis also inT', but the left child ofvinTisv's right child inT'and the right child ofvinTisv's left child inT'. (In other words,T'is the mirror image ofT.)

Show that a preorder traversal of a full binary treeTis the same as the postorder traversal ofT's reflection, but in