#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node * next,* prev;
} ;
struct node * head,* shead,* temp,* temp1;
int main( void ) {
int c= 1 ;
while ( c)
{
temp
= malloc ( sizeof ( struct node
) ) ; printf ( "enter the data for the node\n " ) ; if ( head== NULL) {
head= temp;
head-> next= NULL;
head-> prev= NULL;
shead = head;
}
else {
shead-> next= temp;
temp-> prev= shead;
temp-> next= NULL;
shead = shead-> next;
}
printf ( "for new node enter 1 otherwise 0\n " ) ;
}
temp1= head;
while ( temp1!= NULL) {
temp1= temp1-> next;
}
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8c3RkbGliLmg+CnN0cnVjdCBub2RlCnsKICAgIGludCBkYXRhOwogICAgc3RydWN0IG5vZGUgKm5leHQsKnByZXY7Cn07CnN0cnVjdCBub2RlICpoZWFkLCpzaGVhZCwqdGVtcCwqdGVtcDE7CmludCBtYWluKHZvaWQpewogICAgaW50IGM9MTsKICAgIAogICAgd2hpbGUoYykKICAgIHsKICAgICAgICB0ZW1wID0gbWFsbG9jKHNpemVvZihzdHJ1Y3Qgbm9kZSkpOwogICAgICAgIHByaW50ZigiZW50ZXIgdGhlIGRhdGEgZm9yIHRoZSBub2RlXG4iKTsKICAgICAgICBzY2FuZigiJWQiLCZ0ZW1wLT5kYXRhKTsKICAgICAgICBpZihoZWFkPT1OVUxMKXsKICAgICAgICAgICAgaGVhZD10ZW1wOwogICAgICAgICAgICBoZWFkLT5uZXh0PU5VTEw7CiAgICAgICAgICAgIGhlYWQtPnByZXY9TlVMTDsKICAgICAgICAgICAgc2hlYWQgPSBoZWFkOwogICAgICAgIH0KICAgICAgICBlbHNlIHsKICAgICAgICAgICAgc2hlYWQtPm5leHQ9dGVtcDsKICAgICAgICAgICAgdGVtcC0+cHJldj1zaGVhZDsKICAgICAgICAgICAgdGVtcC0+bmV4dD1OVUxMOwogICAgICAgICAgICBzaGVhZCA9IHNoZWFkLT5uZXh0OwogICAgICAgIH0KICAgICAgICBwcmludGYoImZvciBuZXcgbm9kZSBlbnRlciAxIG90aGVyd2lzZSAwXG4iKTsKICAgICAgICBzY2FuZigiJWQiLCZjKTsKCiAgICB9CiAgICB0ZW1wMT1oZWFkOwogICAgd2hpbGUodGVtcDEhPU5VTEwpewogICAgICAgIHByaW50ZigiJWQiLHRlbXAxLT5kYXRhKTsKICAgICAgICB0ZW1wMT10ZW1wMS0+bmV4dDsKICAgIH0KICAgIAp9