Singly linked list is the most basic linked data structure. Following are important terms to understand the concepts of Linked List. Linked List is a sequence of links which contains items. This is how a linked list is represented. Unlike arrays, the linked list does not store data items in contiguous memory locations. Circular linked lists are used in Round Robin Scheduling, to keep track of the turn in a multi-player game, to implement the undo function, to repeat the songs in a playlist etc. Insertion and deletion of nodes are really easier. This structure is usually called “Singly linked list”. The first part stores the actual data and the second part has a pointer that points to the next node. Each link contains a connection to another link. Unlike array here we don’t have to shift elements after insertion or deletion of an element. A linked list is a linear data structure as well as a dynamic data structure. Nodes in a linked list are linked together using a next field, which stores the address of the next node in the next field of the previous node i.e. Data stored in a Linked List, once allocated in memory, will stay in the same spot. A stack, hash table, and binary tree can be implemented using a doubly linked list. In this tutorial we will understand the working of Singly Linked List & see all operations of Singly Linked List. Basic Linked List Functions Linked list the second most used data structure after array. The real life application where the circular linked list is used is our Personal Computers, where multiple applications are running. In this the elements can be placed anywhere in the heap memory unlike array which uses contiguous locations. So there is no need to give initial size of linked list. A Linked list consists of nodes where each node contains a data field(to store some data values) and a reference to the next node in the list. This is the best answer in the thread. A linked list consists of items called “Nodes” which contain two parts. Format:[data,address] Head->[3,1000]->[43,1001]->[21,1002] In the example, the number 43 is present at location 1000 and the address is present at in the previous node. A linked-list is a sequence of data structures which are connected together via links. Linked lists are useful for dynamic memory allocation. The most popular types of a linked list are: Singly link list; Doubly link list; Example of Linked List. Linked list is a dynamic data structure so it can grow and shrink at runtime by allocating and deallocating memeory. Linked List Basics. Insertion and Deletion. Undo functionality in Photoshop or Word (a linked list of state). Applications that have a Most Recently Used (MRU) list (a linked list of file names). That means as your linked list changes in size, the data of any elements does not move (in memory), so it can be safely pointed at. All the running applications are kept in a circular linked list and the OS gives a fixed time slot to all for running.