Consider the following ordered tree rooted at a. 1. What is the order in which t
ID: 3832306 • Letter: C
Question
Consider the following ordered tree rooted at a. 1. What is the order in which the vertices of the above ordered rooted tree are visited using preorder traversal? Show your work step by step. Otherwise, your answer is wrong. 2. What is the order in which the vertices of the above ordered rooted tree are visited using inorder traversal? Show your work step by step. Otherwise, your answer is wrong. 3. What is the order in which the vertices of the above ordered rooted tree are visited us postorder traversal? Show your work step by step. otherwise, your answer is wrongExplanation / Answer
PreOrder:
The PreOrder Traversal of a Tree involves traversing the root -> left child -> right child. The algorithm for the Inorder Traversal involves:
1. Traverse the left subtree
2. Then, visit the root.
3. Traverse the right subtree
The mentioned tree traversing in preorder manner will be:
a, b, e, f, l, m, n, c, g, h, o, p, d, i, j, q, s, t, u, r, k.
InOrder:
In-order traversal (visiting the left subtree, visiting the root, visiting the right subtree) is not defined for a non-binary tree as there is no left and right subtree.
PostOrder:
The PreOrder Traversal of a Tree involves traversing the left child -> right child -> root. The algorithm for the Postorder Traversal involves:
1. Traverse the left subtree
2. Traverse the right subtree
3. Then, visit the root.
The mentioned tree traveres in preorder manner will be:
e, l, m, n, f, b, g, o, p, h, c, i, s, u, t, q, r, j, k, d, a