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

Question

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

What is the major difference between the two?

Answer 1

A doubly linked list is a list where the elements have pointers to both the element before and after in the list.

A double ended list is from my understanding the same as a deque. That is a queue from which you can add and remove items from both the top and the bottom.