# Concatenating Two Lists

### Procedure :

* Take the head pointer of both linked lists as parameters.
* Traverse to the last node of first list.
* Make the next point to the first of second list.

```c
void concatenate(struct node *first, *second) (

    // Traversing to the last node of first list
    while (first -> next != NULL) {
        first = first -> next;
    }
    // Setting the next as first node of second list
    first -> next = second;
    
}
```

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/concatenating-two-lists.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.