Types of Linked Lists
The three common forms are Singly Linked List, Doubly Linked List, and Circular Linked List. They differ primarily in how nodes reference neighboring nodes and whether the final node terminates at null or connects back into the list.
Singly Linked List: each node contains a next reference.
Doubly Linked List: each node contains both next and previous references.
Circular Linked List: the last node points back to a node in the list, commonly the head.
Doubly linked lists simplify backward traversal and deletion when a node reference is available.
Circular lists are useful for round-robin scheduling and cyclic iteration.