Types Of Linked List
Depending on the way in which the links are utilized to keep adjacency, a number of various kinds of linked lists are possible.
Linear Singly Linked List (or simply linear list)
Circular linked list
- The pointer from the final element in the list points back to the first element.
Doubly Linked List
- Pointers exist between adjacent nodes within each directions.
- The list can be traversed either forward or backward.
- Usually two pointers are maintained to keep track of the list, head and tail.
