Linked list are the linear data structure (like an Array) but not stored in continuous fashion rather nodes are linked using pointers.
-
No fixed size (like Array).
-
Insertion/Deletion is not expensive.
-
Searching is expensive (to access a node, have to go through from the first node).
-
Pointer takes up extra space.
-
Singly Linked List
-
Doubly Linked List
-
Circular Linked List