31
Exercise #3: Non-recursive traversals
Write a non-recursive
preorder
traversal algorithm.
Assume that you have a stack ADT available.
![[prev]](icon/prev.gif){kind=icon}
31
![[next]](icon/next.gif){kind=icon}