Singly Linked List Implementation
Linked List is an another Abstract Data type A linked list is a data structure which contain the list of the elements The elements are stored anywhere in the memory and linked with the address. Linked list is used when the quantity of the data is unknown Data is stored in the form of node and at the run-time memory is allocate for creating a node Data is accessed using the starting pointer of the list Array versus Linked List Array suitable for Randomly access the elements Searching the list of particular elements Inserting or Deleting the particular elements Linked List suitable for Inserting/Deleting the elements Application where sequential access is required In situation where number of elements are unknown Types of Linked List Singly linked List Doubly Linked List Circular Linked List Application of Linked List Linked list is used for implementation of other ADT (Stack,Queue,etc) Linked list is us