Linked list practice

Linked list practice

by Ayesha Akter -
Number of replies: 0

Void insert atbetween(struct node* head,int data,istruct node *prev){

Struct node *ptr= (struct node*)malloc(size of(struct node));

Ptr->data =data;

Ptr->next=prev->next;

Prev->next=ptr;

}


Void isertatbegin(struct node *head, int data){

Struct node *ptr= (struct node*)malloc(size of(struct node));

Ptr->data =data;

Ptr-next=head;

Return ptr;

}