A multiway tree T can be represented as a binary tree T~ by using the firstChild and nextSibling pointers. If we think of the firstChild link as being the left link and the nextSibling link as being the right link, then we can traverse this binary tree T~ as we would any binary tree.
A preorder traversal of T~ is equivalent to which of the following traversals of T? Pre-
order, postorder, neither.
An inorder traversal of T~ is equivalent to which of the following traversals of T? Pre-
order, postorder, neither.
A postorder traversal of T~ is equivalent to which of the following traversals of T? Pre-
order, postorder, neither.
There is no order of left or right child in multiway tree.. so basically one tree structure can have different preorder post order and inorder traversals. So no order can be equivalent to any. Am I correct??