> For the complete documentation index, see [llms.txt](https://xavier-geerinck.gitbook.io/algorithms/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://xavier-geerinck.gitbook.io/algorithms/data-structures/basic-datastructures/linked-list.md).

# Linked List

* Is a sequence of links which contains items
* These links point towards **nodes**
  * A node contains of **Next** pointer and a **data** element containing the data

![](https://1983113773-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-Lc5VIoifZmhHibC2KSG%2F-Lc5VL9WESreusC3YQxb%2F-Lc5VRoO5S0DWfkRfMjE%2Flinkedlist.png?generation=1554887339344330\&alt=media)

## Operations

* **Search:** To find a certain key we look at the data item and keep following the next pointer until our key has been found
* **Insertion:** To insert, we add an element at the front of the list O(1)
* **Deletion:** Find the element, then delete it, reconfiguring the links

## Double Linked List

* In a double linked list, we can move backwards and forwards through the items

![](https://1983113773-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-Lc5VIoifZmhHibC2KSG%2F-Lc5VL9WESreusC3YQxb%2F-Lc5VRoQyC5Ju1AEhKsQ%2Fdouble_linkedlist.png?generation=1554887334202562\&alt=media)

[https://www.tutorialspoint.com/data\\\_structures\\\_algorithms/linked\\\_list\\\_algorithms.htm](https://www.tutorialspoint.com/data_structures_algorithms/linked_list_algorithms.htm)