Skip to main content

Singly Link List

Singly Linked Lists are a type of data structure. In a singly linked list each node in the list stores the information of the node and a pointer to the next node in the list. It does not store any pointer reference to the previous node. It is called a singly linked list because each node only has a single link to another node. To store a single linked list, you only need to store a reference to the first node in that list. The last node has a pointer to NULL to indicate that it is the last node. Before going to discuss the operation on singly 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 or element of singly 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
  Now we see how the singly link list is represented. See the image below: The component of singly list are:

- START pointer points to the first node of the list
- NODE : Each node have info field and next pointer to point next NODE in the list
- Last NODE of the list will point to NULL
  The above structure of node is represented as below: 

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

The different operation that can be performed on the list are :


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

Insertion at specific position N in singly link list

Insertion of a new node at position N in singly link list requires traversing the list for N-1 th node so that links are updated to accommodate the new node in the list. The new node's next is set to point to Nth node of the list and then N-1 th node's next pointer is updated so that it reference to new node. The step by step algorithm to insert node at Nth position is as below: Algorithm to insert node at specific position N in singly link list: This algorithm will insert the new node PTR at the position N in the link list. The steps are as follows: Create new node PTR Set the INFO field of PTR If N is less than 1 Node can't be inserted Else If node is to be inserted at first i.e. [N=1] Make new node PTR points to first node i.e. [PTR->NEXT = START] Make START point to new node PTR i.e. [START = PTR] Else Traverse the list to get the (N-1)th node of list into TEMP Make PTR's next pointer point to Nth node in the list i.e. [PTR -> NEXT  =  TEMP-...
Post a Comment
Read more

Insert node at first position in circular link list

Insertion of new node at first position in circular link list requires creation of new node and setting it's info field. After creation of new node, we make last node points to newly created node and newly created node to the first node of the list. Let us see the algorithm for insertion : Algorithm for insertion at first position in circular link list: In this algorithm, TAIL is pointer to last node and PTR is node to be inserted at first. The step are as follows: Create new node PTR Set the INFO field of PTR If list have no node i.e. [TAIL == NULL] TAIL = PTR PTR->NEXT = PTR [PTR will point to itself] Else PTR->NEXT = TAIL->NEXT [PTR's next will point to first node] TAIL->NEXT = PTR [TAIL's next pointer will point to PTR] End If Function to insert node at first position in circular link list: void insertAtFirst(NODE **tail, int info){ NODE *ptr = (NODE*) malloc(sizeof(NODE)); ptr->info = info; if(*tail == NULL){ //no nodes in list ptr-...
Post a Comment
Read more