1. Linked list is a linear Data structure.
3. Linked list is dynamic in size.
4. A Linked List consist of the series of Nodes Where a node contains the data and the reference of the another Node.

As we Know that Array is of fixed size.  if we have the data and we dont know the size so we can  use linked list to store.

1. Linked list is dynamic that's why we can insert data while the memory full.

2. With the Use of LL we can implement Stack and Queues.

3. Undo Functionality etc.

Example :-

Implementation of the Singly LL :-

We have Discussed Implementation of the Singly Linked List.

Ques 1: Delete Kth Node from the last of the LL.

Ques 2 : Find The Length Of the Linked List or How Many Nodes Are Present in the LL :-

Ques  3:- Find Middle Node In the LL.

Ques 4:- Delete The Middle Node :-

Ques 5 :- Detect The Cycle in The LL.

Ques 6. Reverse a LL.

Ques 7. Find Palindrome of a LL.

Solution :-

1. Find the middle of the linked list.
2. Reverse the second half of the linked list.
3. Compare the first half of the original linked list with the reversed second half.

Ques 8:- Split a linked List into Two Parts : -