Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- QUIZ SOLUTION
- 2)
- void insert_any(int a, int pos)
- {
- struct node *n;
- n = (struct node *) malloc(sizeof(struct node));
- n -> data = a;
- temp = head;
- int i;
- for(i = 0; i < pos - 2; i++)
- {
- temp = temp -> next;
- }
- n -> next = temp -> next;
- temp -> next = n;
- }
- 3)
- void del_any_pos(int a)
- {
- struct node *temp2;
- temp = head;
- while(temp ->data != a)
- {
- temp2 = temp;
- temp = temp -> next;
- }
- temp2 -> next = temp -> next;
- free(temp);
- }
- 4)
- void search(int a)
- {
- temp = head;
- int flag = 0;
- while(temp)
- {
- if(temp -> data == a) flag = 1;
- temp = temp -> next;
- }
- if(flag == 1) printf("Found\n");
- else printf("Not Found\n");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement