What is a linked list? Mention it's types and it's operations.

Linked List contains a link element called first.
Each link carries a data field(s) and a link field called next.
Each link is linked with its next link using its next link.
Last link carries a link as null to mark the end of the list.struct ListNode
{
  int val;
  struct ListNode *next;

};

A linked list is a linear data structure where each element is a separate object.

Linked list elements are not stored at contiguous location; the elements are linked using pointers.
Each node of a list is made up of two items - the data and a reference to the next node. The last node has a reference to null. The entry point into a linked list is called the head of the list.
TYPES OF LINKED LISTS:
1.Singly linked list
2.Doubly linked list
3. Circular singly linked list 
4. Circular doubly linked list
OPERATIONS ON LINKED LIST:
Insertion − Adds an element at the beginning of the list.
Deletion − Deletes an element at the beginning of the list.
Display − Displays the complete list.
Search − Searches an element using the given key.
Delete − Deletes an element using the given key.
Posted on by
Score
Views