Doubly Linked List

   Types of Linked Lists

1. Singly linked list

•Begins with a pointer to the first node

•Terminates with a null pointer

•Only traversed in one direction

2. Circular, singly linked

•Pointer in the last node points

  back to the first node

3. Doubly linked list

•Two “start pointers” – first element and last

element

•Each node has a forward pointer and a backward

pointer

•Allows traversals both forwards and backwards

4. Circular, doubly linked list

•Forward pointer of the last node points to the first

node and backward pointer of the first node points 

to the last node

for code of doubly linked list click here

you may also like:

• single linked list
• Queue implementation
• priority Queue 
• Stack implementation 
• Tower of Hanoi