Traverse tree without recursion and stack in C

Question

How to traverse each node of a tree efficiently without recursion in C (no C++)?

Suppose I have the following node structure of that tree:

struct Node
{
         


        

Answer 1

You can use the Pointer Reversal method. The downside is that you need to save some information inside the node, so it can't be used on a const data structure.