🔒 Locked

trees

Started by nodoubt Jul 20, 2003 at 10:04 AM 1 reply 500+ views

Original Post

Jul 20, 2003 at 10:04 AM

is there a way to transverse a tree (binary) without using recursion? i.e. inorder, postorder, preorder without using recursion... it''s hard to keep track of what''s going on in recursion.. thanks

Shannon Barber

Mod

368

Shannon Barber

Jul 20, 2003 at 10:09 AM

Recursion is easiest. You can also maintain your own stack of nodes (perform the recursion manaually) or you can use a threaded tree which allows non-recursive in-order transversals.

C-Junkie

139

C-Junkie

Jul 20, 2003 at 11:37 AM

you can use a stack and a loop, but this is pretty similiar to recursion...

Topic Locked

This topic has been locked by a moderator. New replies are not allowed.