How Linked List Works

Linked List: A linear data structure where elements (nodes) are stored in sequence, with each node containing data and a pointer/reference to the next node.

• insertAtHead(value) - Add a new node at the beginning of the list.
• insertAtTail(value) - Add a new node at the end of the list.
• insertAtIndex(index, value) - Insert a new node at specific position.
• deleteAtHead() - Remove the first node from the list.
• deleteAtTail() - Remove the last node from the list.
• deleteAtIndex(index) - Remove node at specific position.
• deleteByValue(value) - Remove first occurrence of value.
• search(value) - Find if value exists in the list.
• getSize() - Get the number of nodes in the list.
• isEmpty() - Check if the list is empty.
• print() - Display all nodes in order.
• reverse() - Reverse the order of nodes.
• clear() - Remove all nodes from the list.