The following is the pseudocode for a recursive algorithm to print the values stored in a Binary Tree (in no particular order):

Give the pseudocode of a non-recursive algorithm to print the contents of a Binary Tree (in no particular order) with a complexity that is no worse than the above recursive algorithm.

Hint: you may use a Stack Abstract Data Type in your answer.

print Tree (BTNode t) { if ( t != END ) { print (t.val) print Tree(t. left) print Tree(t. right) } }