A linked list is a data structure used for storing collections of data. A linked list has the following properties.
• Successive elements are connected by pointers
• The last element points to NULL
• Can grow or shrink in size during execution of a program
• Can be made just as long as required (until systems memory exhausts)
• Does not waste memory space (but takes some extra memory for pointers). It allocates memory as list grows.
• Insert: inserts an element into the list
• Delete: removes and returns the specified position element from the list
• Delete List: removes all elements of the list (disposes the list)
• Count: returns the number of elements in the list
• Find nth node from the end of the list
- Alternate Node Deletion ----> [C++](/Code/C++/Deletion of Alternate nodes in a linked list.cpp)
- Cycle detection using Hare and Tortoise algorithm ----> C++ | Java
- Insertion ----> C++ | Java
- Splitting ----> C++
- Deleting Node from Linked List ----> Java
- Delete a given node without using head pointer ----> C++
- Finding intersection node of two linked lists connected in y shape -----> C++ | Python
- Implementation of Linked List ----> Python
- Middle Element ----> Python
- Palindrome Check---->C++ | Java | Python
- Remove Duplicates from Unsorted List ----> C++
- Reversing a Linked List ----> C++
- Reverse Linked List in groups of size k ---->Python
- Unrolled Linked List Implementation ----> C++