Linked List
Each node holds a value and a pointer to the next node. Reaching the i-th node means walking from the head.
Costs
| Category | Data Structure |
| Difficulty | Easy |
| Insert or delete at the head | O(1) |
| Reach the i-th node | O(n) |
| Search | O(n) |
Questions
What is Linked List?
Each node holds a value and a pointer to the next node. Reaching the i-th node means walking from the head.
Where do I practice it?
DSA Master keeps challenges and progress on the phone. This page is the idea and the costs.