traversing binary trees or partial trees

Please check out the file attached as it has a binary tree on it that I don't understand.

(1) it has interior leafs and I need to follow the logic about traversing such kind of binary tree

(2) where do you start to traverse with

preorder

inorder

postorder

types of traversals???

(3) can you list the node more than once??? What is the rule here?

I came up with the following paths:

preorder : U T X U V Y W Z X Y

inorder : U T U X V W Y X Z Y

postorder : T U U V X W Y X Y Z

Are they right? Are they wrong ? Why?