Algorithm 4 Binary Tree Traversal Nonrecursive
Require: a binary tree
Ensure: print all keys appearing in
1:Let be a stack
2:Push()
3:while not StackEmpty() do
4: Pop()
5:if then
6:continue
7:end if
8:print
9:Push()
10:Push()
11:end while