The Algorithm Below Describes the Nonrecursive ____________________ Traversal of a Binary

Short Answer

The algorithm below describes the nonrecursive ____________________ traversal of a binary tree.
1.current = root;
2.while (current is not NULL or stack is nonempty)
if (current is not NULL)
{
push current onto stack;
current = current->lLink;
}
else
{
current = stack.top();
pop stack;
visit current; //visit the node
current = current->rLink;//move to right child
}