Singly Linked List: Each node contains data and a pointer to the next node in the sequence.
Doubly Linked List: Each node contains data and pointers to both the next and previous nodes.
Circular Linked List: A singly linked list where the last node points back to the first node.
Circular Doubly Linked List: A doubly linked list where the last node points to the first node and the first node points back to the last node.
Insertion: Add a new node to the list (at head, tail, or specific position)
Deletion: Remove a node from the list (from head, tail, or specific position)
Traversal: Visit each node in the list sequentially
Search: Find a node with a specific value
Reverse: Reverse the order of nodes in the list