a) Let T be an ordered tree (i.e., the children of each node are ordered) with more than one node. Is it possible that the in-order traversal of T visits the nodes in the same order as the pre-order traversal? If so, give an example; otherwise argue why it cannot happen. Likewise, is it possible that post-order traversal of T visits the nodes in the reverse order as pre-order traversal? If so, give an example; otherwise argue why it cannot happen. b) Answer the previous questions if T is a proper binary tree with more than one node.

Q1. Answer the following questions: a) Let T be an ordered tree (i.e., the children of each node are ordered) with more than one node. Is it possible that the in-order traversal of T visits the nodes in the same order as the pre-order traversal? If so, give an example; otherwise argue why it cannot happen. Likewise, is it possible that post-order traversal of T visits the nodes in the reverse order as pre-order traversal? If so, give an example; otherwise argue why it cannot happen Answer the previous questions if T is a proper binary tree with more than one node. b)