3. Binary Tree Traversals. (10 pts) Consider the following tree. ??--+ 611 | 10

Question

3. Binary Tree Traversals. (10 pts) Consider the following tree. ??--+ 611 | 10 Fill in each of the traversals below: Preorder traversal: Inorder traversal: Postorder traversal: For each traversal put/add the values in an imaginary Stack and a Queue after they are read from the tree. After traversing the tree, write down the contents of the Stack or Queue: Fill in each of the traversals below: Preorder traversal put in Queue: Inorder traversal put in Queue: Postorder traversal put in Queue: Preorder traversal put in Stack: Inorder traversal put in Stack: Postorder traversal put in Stack:

Explanation / Answer

preorder: 4, 2, 7, 6, 11, 3, 1, 8, 10, 9, 5 inorder: 6, 7, 11, 2, 3, 4, 10, 8, 1, 9, 5 postorder: 6, 11, 7, 3, 2, 10, 8, 5, 9, 1, 4

Related Questions

Navigate

• Browse (All)
• Browse 3
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.