Need help on the last question only. 3a) 3. Binary Tree Traversals. (10 pts) Con

Question

Need help on the last question only. 3a) 3. Binary Tree Traversals. (10 pts) Consider the following tree 1 61 111 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: Pill 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: 3a) Using the full IntTreeNode constructor, write one statement that creates the tree depicted above (6 pts). We did an example of this in class

Explanation / Answer

preorder traversal put in Queue: 4 2 7 6 11 3 1 8 10 9 5

inorder traversal put in Queue: 6 7 11 2 3 4 10 8 1 9 5

postorder traversal put in Queue: 6 11 7 3 2 10 8 5 9 1 4

preorder traversal put in Stack: 5 9 10 8 1 3 11 6 7 2 4

inorder traversal put in Stack: 5 9 1 8 10 4 3 2 11 7 6

postorder traversal put in Stack: 4 1 9 5 8 10 2 3 7 11 6

Related Questions

Navigate

• Browse (All)
• Browse N
• Subjects

---

---

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