> For the complete documentation index, see [llms.txt](https://nitinranganath.gitbook.io/data-structures/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://nitinranganath.gitbook.io/data-structures/binary-tree/iterative-tree-traversals.md).

# Iterative Tree Traversals

**The below functions assume that a stack of type pointer to Node is already created which supports push and pop operations.**

### Preorder Traversal :

```c
void preorderTraversal(struct Node *ptr) {

    // A stack to keep track of visited nodes
    struct Stack s;
    
    // Iterate until pointer is not NULL or stack is not empty
    while (ptr != NULL || !isEmpty(s)) {
        if (ptr) {
            printf("%d\t", ptr -> data);
            // Push current node address to stack
            push(&s, p);
            ptr = ptr -> left;
        } else {
            ptr = pop(&s);
            ptr = ptr -> right;
        }
    }

}
```

### Inorder Traversal :

```c
void inorderTraversal(struct Node *ptr) {

    // A stack to keep track of visited nodes
    struct Stack s;
    
    // Iterate until pointer is not NULL or stack is not empty
    while (ptr != NULL || !isEmpty(s)) {
        if (ptr) {
            // Push current node address to stack
            push(&s, p);
            ptr = ptr -> left;
        } else {
            ptr = pop(&s);
            printf("%d\t", ptr -> data);
            ptr = ptr -> right;
        }
    }

}
```

### Postorder Traversal :

```c
void postorderTraversal(struct Node *ptr) {

    // A stack to keep track of visited nodes
    struct Stack s;
    
    // Iterate until pointer is not NULL or stack is not empty
    while (ptr != NULL || !isEmpty(s)) {
        if (ptr) {
            // Push current node address to stack
            push(&s, p);
            ptr = ptr -> left;
        } else {
            ptr = pop(&s);
            ptr = ptr -> right;
            printf("%d\t", ptr -> data);
        }
    }

}

```

Contributed by Nitin Ranganath


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://nitinranganath.gitbook.io/data-structures/binary-tree/iterative-tree-traversals.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.