List
Linked List
A data structure where each element contains a value and a reference to the next node, supporting efficient insertion and deletion operations.
- Time complexity for access and search is Linear, i.e. O(n)
- Time complexity for insertion and deletion is Constant, i.e. O(1)
- Space complexity is Linear