3. [3 points] For the binary tree shown below (which is NOT a complete binary tree, of course), write the results of different traversals: preorder, inorder, postorder. Z /\ / \ / \ X Y /\ / / \ / U V W \ \ T