difference between double-ended linked lists and doubly-linked list

data-structures linked-list doubly-linked-list
pycod333 picture pycod333 · Feb 4, 2015 · Viewed 27.3k times · Source

I don't understand difference between a double-ended and doubly-linked list.

What is the major difference between the two?

Answer

Kapoios picture Kapoios · Feb 4, 2015

In a doubly linked list, each node has two pointers. One towards its next node and another one towards its previous node.

enter image description here

In a double-ended linked list, each node has just one pointer which points to its next node. Its difference from the single-ended linked list is that instead of just one "head" node, it contains two pointers of this kind ("first" and "last"), so someone is able to insert elements to list from both ends of it.

enter image description here

(Last picture isn't that clear, but it catches the point of the two ends.)

Related questions

Real life use of doubly linked list

When does using a doubly linked list seem to be best option in real life scenario? Can someone suggest practical use of it?

Read More
How do I create a Linked List Data Structure in Java?

What's the best way to make a linked list in Java?

Read More
How to reverse a singly linked list using only two pointers?

I wonder if there exists some logic to reverse a singly-linked list using only two pointers. The following is used to reverse the single linked list using three pointers namely p, q, r: struct node { int data; struct node *link; }; …

Read More