#### In computer science, we use a group of nodes to represent a sequence data. It's a data structure operation. Link list is a way of storing data in a sequence and use those data easily. This allow us to pick or delete data in a specific location of 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 list

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

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

In Circular Link List, the last tail point to the first nodes head. If we do like this, it's called 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)

let key = 7
found = false
{