#include<stdio.h>
struct node
{
int item;
struct node *next
};
int main()
{
struct node *start,*list,*temp;
int i;
int num;
start
= (struct node
*)malloc(sizeof(struct node
)); list = start;
start->next = NULL;
for(i=1;i<5 ;i++)
{
list->item = i;
list
->next
= (struct node
*)malloc(sizeof(struct node
)); list = list->next;
}
list->next = NULL;
//printf("Enter the element");
temp =start;
while(temp!=NULL)
{
if(temp->item == num)
{
printf("%d is present\n",num
); }
temp = temp->next;
}
if(flag == 0)
{
printf("%d is not present\n",num
); }
printf("Elements of linked lists are:\n"); while(start != NULL)
{
if (start->next == NULL)
{
break;
}
start = start->next;
}
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4Kc3RydWN0IG5vZGUKewogICAgaW50IGl0ZW07CiAgICBzdHJ1Y3Qgbm9kZSAqbmV4dAp9OwppbnQgbWFpbigpCnsKICAgIHN0cnVjdCBub2RlICpzdGFydCwqbGlzdCwqdGVtcDsKICAgIGludCBpOwogICAgaW50IG51bTsKICAgIHN0YXJ0ID0gKHN0cnVjdCBub2RlICopbWFsbG9jKHNpemVvZihzdHJ1Y3Qgbm9kZSkpOwogICAgbGlzdCA9IHN0YXJ0OwogICAgc3RhcnQtPm5leHQgPSBOVUxMOwogICAgZm9yKGk9MTtpPDUJO2krKykKICAgIHsgICAKICAgICAgICBsaXN0LT5pdGVtID0gaTsKICAgICAgICBsaXN0LT5uZXh0ID0gKHN0cnVjdCBub2RlICopbWFsbG9jKHNpemVvZihzdHJ1Y3Qgbm9kZSkpOwogICAgICAgIGxpc3QgPSBsaXN0LT5uZXh0OwogICAgICAgfQogICAgbGlzdC0+bmV4dCA9IE5VTEw7Ci8vcHJpbnRmKCJFbnRlciB0aGUgZWxlbWVudCIpOwpzY2FuZigiJWQiLCZudW0pOwp0ZW1wID1zdGFydDsKIHdoaWxlKHRlbXAhPU5VTEwpCiAgewogICAgaWYodGVtcC0+aXRlbSA9PSBudW0pCiAgICB7CiAgICAJcHJpbnRmKCIlZCBpcyBwcmVzZW50XG4iLG51bSk7CiAgICB9CiAgICB0ZW1wID0gdGVtcC0+bmV4dDsKICB9CiAgaWYoZmxhZyA9PSAwKQogIHsKICAgIHByaW50ZigiJWQgaXMgbm90IHByZXNlbnRcbiIsbnVtKTsKICB9ICAKICBwcmludGYoIkVsZW1lbnRzIG9mIGxpbmtlZCBsaXN0cyBhcmU6XG4iKTsKICB3aGlsZShzdGFydCAhPSBOVUxMKQogICAgeyAgIAogICAgCWlmIChzdGFydC0+bmV4dCA9PSBOVUxMKSAKICAgIAkgIHsKICAgICAgICAgICBicmVhazsKICAgIAkgIH0KICAgICAgICBwcmludGYoIiVkXG4iLHN0YXJ0LT5pdGVtKTsKICAgICAgICBzdGFydCA9IHN0YXJ0LT5uZXh0OwogICAgfSAKcmV0dXJuIDA7Cn0KCgo=