A Linked List is a linear data structure where each element (node) contains a value and a pointer to the next node.
Unlike arrays, elements are not in contiguous memory — each node can be anywhere, connected by pointers.
Operations:
append: add node at the end — O(1) with tail pointer
prepend: add node at the beginning — O(1)
search: traverse to find a value — O(n)
delete: remove a node by value — O(n)
access: traverse from head — O(n)
Advantages:
- O(1) insertion/deletion at known positions
- Dynamic size, no wasted memory
Disadvantages:
- O(n) access by index (no random access)
- Extra memory for pointers
- Not cache-friendly
Related algorithms
Frequently asked questions
- What is Linked List?
- A Linked List is a linear data structure where each element (node) contains a value and a pointer to the next node.
- What is the complexity of Linked List?
- Linked List is explained with a step-by-step visualization, including time and space complexity where applicable.
- Who is this Linked List visualizer for?
- The Linked List visualization targets beginner-level learners in the Data Structures category. Useful for students, interview prep, and hands-on review.
- What algorithms are related to Linked List?
- In the same category (Data Structures) you can explore: Stack, Queue, Hash Table. Each has an interactive visualization.