A linked list is a variation of the singly linked list where each node also contains a pointer to it's previous node as well as it's next node. This additional reference can introduce performance improvements for insertions and deletions at the cost of additional memory.
| Operation | Time Complexity |
|---|---|
| Insertion at Beginning | |
| Insertion at End | |
| Insertion at Position | |
| Deletion at Beginning | |
| Deletion at End | |
| Deletion at Position | |
| Searching for Element |