#### In computer science, we use a group of nodes to represent sequence data. It's a data structure operation. The link list is a way of storing data in a sequence and use those data easily. This allows us to pick or delete data in a specific location of the list.

• Pseudo-code for insert at Beginning
• Pseudo-code for insert at End
• Pseudo-code for delete from Beginning
• Pseudo-code for delete from End
• Pseudo-code for insert at Kth position of the list
• Pseudo-code for delete from Kth position of the list
• Pseudo-code for search data in the list

Singly Link List contains a data find and also a tail to point the next data field or node.

Doubly Link List contains a head, a data find, and also a tail to point the next data field or node.

In the Circular Link List, the last tail point to the first node's head. If we do like this, it's called a circular linked list otherwise it's called linear or open list.

### 1.  Pseudo-code for Insert at Beginning

 Pseudo-code for Insert at Beginning
getcell(m) //here m is a new cell containing data 1
m -> data = 1

### 2. Pseudo-code for insert at End

 Pseudo-code for insert at End
getcell(m) //here m is new cell containing data 9
 Pseudo-code for insert at End

m->data = 8

### 3. Pseudo-code for delete from Beginning

 Pseudo-code for delete from Beginning
free(temp)

### 4. Pseudo-code for delete from End

#### Before deletion process:

 Pseudo-code for delete from End(before)
{
}

 Pseudo-code for delete from End(before)

#### After Deletion process:

 Pseudo-code for delete from End(after deletion)

### 5. Pseudo-code for insert at Kth position of the list

#### insert at Kth position of the list

getcell(m) //we will insert in pos=3

 insert at Kth position of the list

pos = k
for(i=1; i<=pos-2; i++)

### delete from Kth position of the list(before)

for(i=1; i<=pos-2; i++)
 delete from Kth position of the list(before)

free(temp)

### 7. Pseudo-code for search data in list

#### Pseudo-code for search data in list

let key = 7
found = false
{
found = true

else
}
if(found == true) //search key found
So, you can now try to write some code using a linked list.
Happy Coding