Skip to main content

Doubly Link List

Doubly Link List is data structure which contains list of node having info part and pointer to previous and next node of the list. This makes traversal easy. The last node's next and first node's prev pointer points to nothing. Before going to discuss the operation on doubly link list, we will first see the basic structure of the data type and see how it could be represented in c programming. First we will see the how the node of doubly link list is represented. See the image below:
The component of singly list node:
  • info : It contains the actual information
  • next : This field points to the next node in the list
  • prev : This field points to the previous node in the list
Now we see how the doubly link list is represented. See the image below:



The component of doubly list are:
  • START pointer points to the first node of the list
  • NODE : Each node have info field, next pointer to point next NODE in the list and prev pointer to point previous node in the list
  • prev of first node and next of last node will points to NULL
The above structure of node is represented as below:

struct node{
 int info;
 struct node *next, *prev;
};
typedef struct node NODE;

Now we see the different operation that can be performed on the doubly link list:
Labels:

Comments

Post a Comment

Popular posts from this blog

Link List

In computer science, a linked list is a linear collection of elements, called nodes, each node have info field and next field pointing to the next node by means of a pointer. It is a data structure consisting of a group of nodes in sequence and connected with links. In simplest form of this data structure, each node is consist of data and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. Types of Link List Singly Link List: Insert node at first position in singly link list Insert node at last position in singly link list Insert node at specific position in singly link list Delete node at first position in singly link list Delete node at last position in singly link list Delete node at specific position in singly link list Find number of nodes in singly link list Dublication of singly link list Concatenation of two singly link list So...
Post a Comment
Read more

Deletion of node at specific position N in circular link list

Now we will see how to delete node at position 'N' in circular link list. Algorithm to delete node at position 'N' in circular link list: In this algorithm, TAIL points to last node of the link list and POS is position where the new node to be deleted. The steps are as follows: Initialize TEMP and TEMP2 If list have no node or position is less than one  (TAIL == NULL or POS < 1) Node cannot be deleted Else If (POS == 1) If list have one node   (TAIL->NEXT == TAIL) Delete TAIL   (TAIL = NULL) Else Delete the first node   (TAIL->NEXT = TAIL->NEXT->NEXT) End If; Else Set TEMP = TAIL->NEXT   (TEMP now points to first node) Traverse the list for (POS-1)th node using TEMP If node to be deleted is last node i.e. (TEMP->NEXT == TAIL) Set TAIL = TEMP End If; Set TEMP->NEXT = TEMP->NEXT->NEXT End If; End If;     Function to delete node at position 'N' in circular link list: int deleteAtPosition(NODE **tail, ...
Post a Comment
Read more

Deletion of first node in circular link list

Deletion of first node from the circular link list requires that the list has at least one node. It is error to delete a node doesn't exist. In this process, last node's next pointer is updated to point to second node of the list. Now we will see the algorithm to delete node at first position in circular link list. Algorithm to delete first node in circular link list: The algorithm uses TAIL as pointer to the last node of circular list and TEMP is temporary pointer that help in deletion process. The steps are as follows: Declare TEMP If list have only one node FREE (TAIL) TAIL = NULL Else TEMP = TAIL->NEXT  [TEMP will point to first node] TAIL->NEXT = TAIL->NEXT->NEXT [TAIL's next will now point to second node] Free (TEMP) [free the first node] End If; Function to delete node at first position in circular link list: The function takes pointer to last node as input and return info part of the list if no error occur, otherwise returns -1 after printi...
Post a Comment
Read more