On 5/13/06, thomas <[EMAIL PROTECTED]
> wrote:
Feng wrote:When you visit a node N which has two children ( binary tree, for example ) L(N) and R(N), if the next step is visiting L(N), then save L(N) and make L(N) points to N's father which has been saved before. The pointers to fathers take place of stack or recursion.
On 5/13/06, Manu <[EMAIL PROTECTED] > wrote:
Find an iterative method to do the traversal of a tree (inorder
say)....
without using recursion and without using stack.......
A threaded binary tree may be what he needs.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
