**Introduction to Singly linked list : ** A singly linked list is a set of nodes where each node has two fields ‘data’ and ‘link’. The ‘data’ field stores actual piece of information and ‘link’ field is used to point to next node. Basically ‘link’ field is nothing but address only.

**Introduction to Doubly linked list : **A **Doubly Linked List** (DLL) contains an extra pointer, typically called *previous pointer*, together with next pointer and data which are there in singly linked list.

**Singly linked list vs Doubly linked list**

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Remove all even parity nodes from a Doubly and Circular Singly Linked List
- Convert singly linked list into circular linked list
- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
- Difference between a Static Queue and a Singly Linked List
- Convert Singly Linked List to XOR Linked List
- Construct a Doubly linked linked list from 2D Matrix
- QuickSort on Singly Linked List
- Sum of the nodes of a Singly Linked List
- Alternate Odd and Even Nodes in a Singly Linked List
- Binary Search on Singly Linked List
- Insertion Sort for Singly Linked List
- Alternating split of a given Singly Linked List | Set 1
- Circular Singly Linked List | Insertion
- Convert a Singly Linked List to an array
- Implement a stack using singly linked list
- Product of the nodes of a Singly Linked List
- Reverse a Doubly Linked List
- Reverse a Doubly Linked List | Set-2
- Doubly Linked List Tutorial

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.