# Searching in a Node

### Iterative Method :

```c
struct node * search(struct node *ptr, int key) {

    while (ptr != NULL) {
        if (ptr -> data == key) {
            // Return address of node if found
            return ptr;
        }
        ptr = ptr -> next;
    }
    return NULL;

}
```

### Recursive Method :

```c
struct node * search(struct node *ptr, int key) {

    // Base condition
    if (ptr == NULL) {
        return NULL;
    } 
    
    // Recursive call
    if (ptr -> data == key) {
        return ptr;
    else {
        return search(ptr -> next, key);
    }
    
}
```

### Improving Using Move to Head Technique :

```c
struct node * search(struct node *ptr, int key) {

    // A pointer which will follow ptr
    struct node *prev = NULL;
    
    while (ptr != NULL) {
        if (p -> data == key) {
            // Move the found node to the start 
            prev -> next = ptr -> next;
            ptr -> next = head;
            head = ptr;
            return ptr;
        }
        prev = ptr;
        ptr = ptr -> next;
    }
    return NULL;

}
```

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/searching-in-a-node.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.