posted 23 years ago
John,
Usually the Towers of Hanoi problem is created in such a way as the recursive traversal of the data creates a "binary tree" in code. And usually it is considered in-order.
But given a general binary tree one traverses the orders by
recrusive moves, such as:
for in-order:
for pre-order:
for post-order:
for towers of hanoi, you can create by
[This message has been edited by Steve Fahlbusch (edited February 14, 2001).]