In computer science, a linked list is a very commonly used linear data structure that includes a series of connected nodes. Each node stores the data and the address of the next node. Linked lists can be of multiple types: singly, doubly and circular linked list. Singly linked lists contain nodes which have a data part as well as an address part. In a doubly linked list, each node contains a data part and two addresses, one for the previous node and one for the next node. In circular linked list the last node of the list holds the address of the first node, hence forming a circular chain. They are dynamic in nature which allocates the memory when required. Insertion and deletion operations can be easily initiated. Stacks and queues can be easily executed. It also reduces the access time. It also has disadvantages such as: the memory is wasted as pointers require extra memory for storage, no element can be accessed randomly, it has to access each node sequentially, reverse Traversing is difficult in linked list. Linked lists are used to implement stacks, queues and graphs. It lets to insert elements at the beginning and end of the list.

Gokul Pradeep

119 resources

0

0

1

Like