How Do I do a non-recursive binary tree traversal, both breath-first and depth-first?
Why don't we use Threaded Binary Trees ?
How do you do it without the use of stacks and queues (basically without additionaly memory)?
Use a stack manually.
Non-Recursive Binary Tree Traversal
Why don't we use Threaded Binary Trees ?
Non-Recursive Binary Tree Traversal
How do you do it without the use of stacks and queues (basically without additionaly memory)?
Non-Recursive Binary Tree Traversal
Use a stack manually.