Consider the binary tree traversal algorithm below. Algorithm stackTraversal(tre

Question

Consider the binary tree traversal algorithm below. Algorithm stackTraversal(treeNode n) Input: a treeNode n Output: Prints the value of each node in the binary tree rooted at n Stack s leftarrow new Stack(); s.push(n); while (! s.empty()) do x leftarrow s.pop(); print x.getValue(); if (x.getRightChild() != null) then s.push(x.getRightChild()); if (x.getLeftChild() != null) then s.push(x.getLeftChild()); Write the output being printed when stackTraversal(root) is executed. This is the equivalent of what traversal method seen previously in class?

Explanation / Answer

If We have a Tree Like

1

       /      

      2          3

    /          /

   4    5 6 7


Then we will get The PRE-ORDER TRAVERSAL OF BINARY TREE


Output will be : 1 2 4 5 3 6 7


Represents The PreOrder Traversal

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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