# Counting the Nodes

### Iterative Method :

```c
int count(struct node *ptr) {

    // A variable to keep track of count
    int count = 0;

    // Iterate till ptr becomes NULL
    while (ptr != NULL) {
        count++;
        ptr = ptr -> next;
    }
    return count;

}
```

### Recursive Method :

```c
int count(struct node *ptr) {

    // Base condition for termination
    if (ptr == NULL) {
        return 0;
    }
    // Recursive call 
    else {
        return count(ptr -> next) + 1;
    }

}
```

### Time and Space Complexity :

{% tabs %}
{% tab title="Iterative" %}
Time complexity : **O(n)**\
Space complexity : **O(1)**
{% endtab %}

{% tab title="Recursive" %}
Time complexity : **O(n)**\
Space complexity : **O(n)**
{% endtab %}
{% endtabs %}

Contributed by Nitin Ranganath


---

# Agent Instructions: 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:

```
GET https://nitinranganath.gitbook.io/data-structures/linked-list/counting-the-nodes.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
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.