Write a program that implements Linked List operations.
'In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence. In its most basic form, each node contains: data, and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. More complex variants add additional links, allowing more efficient insertion or removal of nodes at arbitrary positions. A drawback of linked lists is that access time is linear (and difficult to pipeline). Faster access, such as random access, is not feasible. Arrays have better cache locality compared to linked lists.'¹.
- Create node
- Insert at the beginning
- Insert at the end
- Remove at the beginning
- Remove at the end
- Sort
- Reverse
- Free
- Traverse
- Has cycle
- Is palindrome
- Get the 'data' of the index-th node
- Add a node of value 'data' at the index-th node
- Delete the index-th node
- Search node by the given key
- Get length
- Merge two sorted lists
- Split list
- Merge sort
1 - Linked List