Tree Traversal
1. Consider the following Inorder and Preorder traversal of a binary tree:
Inorder = {6, 4, 7, 2, 12, 5, 1, 18, 3, 19}
Preorder = {1, 2, 4, 6, 7, 5, 12, 3, 18, 19}
Reconstruct the binary tree and choose the correct postorder traversal from the given options:
Inorder = {6, 4, 7, 2, 12, 5, 1, 18, 3, 19}
Preorder = {1, 2, 4, 6, 7, 5, 12, 3, 18, 19}
Reconstruct the binary tree and choose the correct postorder traversal from the given options:
2. Consider the following Inorder and Postorder traversal of a binary tree:
Inorder = {D, B, E, A, F, G, C, H}
Postorder = {D, E, B, F, G, H, C, A}
Reconstruct the binary tree and choose the correct preorder traversal from the given options:
Inorder = {D, B, E, A, F, G, C, H}
Postorder = {D, E, B, F, G, H, C, A}
Reconstruct the binary tree and choose the correct preorder traversal from the given options: