Problem
Let a visit action in the Euler tour traversal be denoted by a pair (v,a), where v is the visited node and a is one of left, below, or right. Design and analyze an algorithm for performing operation tourNext(v, a), which returns the visit action (w,b) following (v,a).
a. Is a preorder traversal of T ′ equivalent to a preorder traversal of T?
b. Is a postorder traversal of T ′ equivalent to a post order traversal of T?
c. Is an inorder traversal of T ′ equivalent to one of the standard traversals of T? If so, which one?