what is Doubly and Circular linked list? [ simple explanation ]

doubly linked list:
linked list containing nodes that carries two pointer one (left side one) for the previous node and the other for (right side one) the next node. so Doubly liked list's node carries 3 field.

1. link to point the previous node
2. integer value carrying field 
3. link to point the next node.

this picture might help to understand :

photo credit: http://en.wikipedia.org/wiki/Doubly_linked_list

circular linked list:
in short, linked list of which 1st node's link is stored in the link part of the last node.


little help with a diagram:

heads up:
non circular is mostly known as acyclic