Referring to the above tree structure, what is the order of nodes visited using

Question

Referring to the above tree structure, what is the order of nodes visited using a pre-order A. traversal? [1 2 3 7 5 6 4 9 8] [1 2 3 4 7 5 6 8 9] [1 3 2 7 5 8 9 6 4] [4 2 1 3 6 5 7 9 8] Referring to the above tree structure, what is the order of nodes visited using an in-order traversal? [1 2 3 7 5 6 4 9 8] [1 2 3 4 7 5 6 8 9] [1 3 27 5 8 9 6 4] [4 2 1 3 6 5 79 8] Referring to the above tree structure, what is the order of nodes visited using a post-order traversal? [1 2 3 7 5 6 4 9 8] [1 2 3 4 7 5 6 8 9] [1 3 2 7 5 8 9 6 4] [4 2 1 3 6 5 7 9 8] Fill in each node in the tree shown below with integer values (of your choice) so that the tree is a binary search tree:

Explanation / Answer

A)

Pre order Traversal: A node is visited before its children.

Answer: option (d)

B)

In-order Traversal: A node is visited after it's left child and before its right child.

Answer: option (b)

C)

Post order Traversal: A node is visited after its children.

Answer: option (c)

D)

Property of Binary search tree: value(Left) <= Value(root) <= Value(right)

So, following is a possibility of values.

10

5 15

1 11 16

12

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

---

---

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