How to traverse a TREE without recursion?

Question

How to traverse a binary search tree diagonally? Any sample algo/code?

Answer 1

Thanks Jai, following is C++ implementation

void inOrderTraversalWithOutStack(struct node* node)    {
    std::stack<struct node*> stk;
    struct node* current = node;
    while(current)  {
        while(current)  {
            stk.push(current);
            current = current->left;
        }
        while(current == NULL && !stk.empty())  {
            current = stk.top();
            stk.pop();
            printf("%d \t", current->data);
            current = current->right;
        }
    }
}

Comments

This is Depth first way of searching. Depends on usage other option would be Breadth First Search.