Problem
Implement the tree ADT using the binary tree representation described in Exercise C-7.12. You may reuse the Linked Binary Tree implementation of a binary tree.
Exercise C-7.12
We can define a binary tree representation T ′ for an ordered general tree T as follows
• For each node u of T, there is an internal node u ′ of T ′ associated with u.
• If u is an external node of T and does not have a sibling immediately following it, then the children of u ′ in T ′ are external nodes.
• If u is an internal node of T and v is the first child of u in T, then v is the left child of u ′ in T ′.
• If node v has a sibling w immediately following it, then w ′ is the right child of v ′ in T ′. Given such a representation T ′ of a general ordered tree T, answer each of the following questions: a. Is a preorder traversal of T ′ equivalent to a preorder traversal of T? b. Is a postorder traversal of T ′ equivalent to a postorder traversal of T? c. Is an inorder traversal of T ′ equivalent to one of the standard traversals of T? If so, which one?