The data structure that linked lists compete directly with it the array. Each data structure has its own strengths and weaknesses. So the choice of a particular data structure depends upon the requirements of a problem. Linked list is...

Deletion in Linked List
Deletion is another frequent operation performed on the linked list. The delete operation logically removes a node from the linked list by changing various link pointers. Once the node is deleted, the space taken...

Insertion in Linked List
Insertion in among the most frequent operation performed on the linked list. Insertion can be performed on a sorted or unsorted linked list. In a sorted list, nodes are maintained in a sequence according to...

Searching a sorted linked list
The linked list that we have seen so far was unsorted, however for certain applications it is useful to maintain the data in a sorted order within the linked list. A linked list with this characteristics...

Searching an unsorted linked list
Lets assume that data in the given linked LIST is unsorted. Also suppose a specific ITEM of information that we are looking for is given. In order to search for ITEM in the LIST, we begin comparing...

Searching in linked list
Searching is one the simplest operation of the linked list. It is the process of finding the location of the node containing the desired item in the linked list. Search is considered successful if the node containing...

Traversing of Linked List
Traversing involves processing each node of the linked list exactly once from the beginning to the end following the chain of references. Lets consider a linked List stored in memory with pointer Head pointing...

Linked List is a linear data structure consisting of elements called nodes where each node is composed of two parts : information part and a link part also called the next pointer part. The information part contains user supplied data...

Linked List is a linear data structure consisting of elements called nodes where each node is composed of two parts : information part and a link part also called the next pointer part. The information part contains user supplied data...