It can be done without using a stack, by using the pointers in the
node to keep track of the path back up the tree. The algorithm will
temporarily modify the tree, but when completed the tree will be
restored to its original state.
Don
On Aug 15, 8:07 am, rohit raman.u...@gmail.com wrote:
Can
I think only condition given is not to use recursion, so auxiliary
data structures can be used.
On Aug 15, 7:30 pm, ankit sambyal ankitsamb...@gmail.com wrote:
Morris in order traversal will do in order traversal without using recursion
or a stack.
--
You received this message because you
u can use threaded binary trees to avoid stacking
On Mon, Aug 15, 2011 at 9:48 PM, Navneet navneetn...@gmail.com wrote:
I think only condition given is not to use recursion, so auxiliary
data structures can be used.
On Aug 15, 7:30 pm, ankit sambyal ankitsamb...@gmail.com wrote:
Morris in
