Singly list program using data structures in C?

Answer 1

//Singly linked list:

#include<stdio.h>

#include<stdlib.h>

typedef struct list

{

int data;

struct list *next;

}node;

node *head = NULL;

node* create_node()

{

node *new1 =malloc(sizeof(node));

printf("\nEnter data:");

scanf("%d",&new1->data);

new1->next = NULL;

return(new1);

}

void insert_beg()

{

node *new1;

if(head 1)

insert_beg();

else

insert_after();

break;

case 3: search();

break;

case 4: display();

break;

case 5: printf("\nEnter the data to be found");

scanf("%d",&x);

find_prev(x);

break;

case 6: deletion();

break;

case 7: exit(0);

}

printf("\n\n");

}while(ch != 7);

getchar();

return 0;

}