Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<stdlib.h>
- typedef struct List{
- struct list *next;
- char *name;
- }list;
- list *start = NULL;
- list *end = NULL;
- list *liste = NULL;
- int count_nodes=0;
- list *add(list *liste,char *data){
- list *neu = malloc(sizeof(list));
- if(liste==NULL){
- liste=malloc(sizeof(list));
- start=neu;
- end=neu;
- liste=start;
- }
- else{
- end->next=neu;
- end=neu;
- }
- neu->name=data;
- neu->next=NULL;
- count_nodes++;
- free(neu);
- return liste;
- }
- /*
- list *rm(list *liste,char *name){
- list *del = malloc(sizeof(list));
- del=start;
- while(del!=NULL){
- if(del->name==name){
- printf("%s\n",del->name);
- }
- del=del->next;
- }
- free(del);
- }*/
- int main(int argc, char *argv[]){
- char n1 [] = "rob";
- char n2 [] = "til";
- liste=add(liste,n1);
- liste=add(liste,n2);
- /*
- liste=rm(liste,n1);
- */
- int i;
- for(i=0;i<count_nodes;i++){
- printf("%s\n",start->name);
- start=start->next;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement