# Linked Lists  II

Hello everybody, I am continuing linked lists and will be talking about doubly linked lists. Hope you all have found my previous blog to be helpful.

So here I'll be talking about doubly linked lists.

Doubly linked lists are similar to singly linked lists but the only difference here is that each node has three components.

i) Data of node.

ii) ID of next/successive node.

iii) ID of the previous node.

![](https://cdn.hashnode.com/res/hashnode/image/upload/v1686820117174/402f4aee-d626-4b17-b2d2-f78714ed3a66.png align="center")

The above diagram clearly shows what a doubly linked list looked like.

This linked list is also implemented using the OOPs concept.

This is all about the doubly linked list. Hope you all find it knowledgeable.

Please do comment down for any queries or changes you feel should be in here.

Thanks