Consider the binary tree traversal algorithm below. Algorithm queue Traversal (t

Question

Consider the binary tree traversal algorithm below. Algorithm queue Traversal (tree Node n) Input: a tree Node n Output: Prints the value of each node in the binary tree rooted at n Queue q *- new Queue (); q. enqueue(n); while (! q. empty O) do x *- q. dequeue (); print x. get Value (); if (x. get Left Child () ! = null) then q. enqueue (x. get Left Child ()); if (x. get Right Child Q != null) then q. enqueue (x. get Right Child ()); Write the output being printed when queue Traversal (root) is executed.

Explanation / Answer

Here, the root of the tree will be printed 1st.

Then left child of the root node will be printed.

If this left child of the root node is leaf node, right child of root node will be printed.

This means, the output of the algorithm queueTraversal will be "pre order" of the tree.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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