# Difference between a singly linked list and a doubly linked list

## Introduction

Linked list is an important topic to understand while preparing for technical interviews, and it may be used to answer a variety of problems. To solve and answer complex questions, it is necessary to have a profound understanding of the fundamental principles.

This blog will discuss a fundamental but significant topic, i.e., the differences between a singly linked list and a doubly linked list.

A unidirectional linked list containing a set of ‘N’ nodes that can be traversed from the first node to the last node is called a singly linked list. Its node consists of two parts, data and a pointer containing the address of the next node.

For example,

A linked list containing a set of ‘N’ nodes that can be traversed in both directions, i.e., forward and backward, is termed as a doubly-linked list. Each node of a doubly-linked list consists of three parts, data, and two pointers, one containing the address of the next node and the other having the address of the previous node.

For example,

## Differences

Let us look at a few key differences between a singly linked list and a doubly linked list.

## Key Takeaways

Practicing a bunch of questions is not enough in this competitive world. So go check out where you stand among your peers by taking our mock tests and see which areas need improvement.

Do you know how to implement a Linked List? Let's watch the below video to understand it beforehand.

In case of any comments or suggestions, feel free to post them in the comments section.