Форум программистов [Powered by Invision Power Board]

Код

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include <ctype.h>
#include <malloc.h>

#define QUE struct que            
QUE {
    int info;
    QUE *next;
};

void insert(QUE **q, int item);
void display(QUE * q);
QUE * create_list();
QUE *q = NULL;

void display(QUE * q) {
    QUE * current = q;
    printf("\nLIST=");
    if (current) {
        while(current) {
            printf("%d-->", current->info);
            current = current ->next;
        }
        printf("NULL");
    }
    else
        printf("pustoy");
    printf("\n");
}
QUE * create_list() {
    QUE * list=NULL;
    int done=1,
    info, c;
    printf("Creation of list:\n");
    while(done)
    {
        printf("Add new element? (Y/N)");
        c = getch();
        c = toupper(c);
        switch(c) {
            case 'Y':    printf("\n Element=");
                        scanf("%d", &info);
                        insert(&q, info);
                        break;
            case 'N':    done = 0;
                        break;
        }
    }
    return (list);
}
void insert (QUE **q, int item) {
    QUE *current=*q;
    QUE *previous=0;
    QUE *new_node;
    while(current) {
        previous=current;
        current=current->next;
    }
    new_node=(QUE*) malloc (sizeof (QUE));
    new_node->info=item;
    if (previous) {
        new_node->next=previous->next;
        previous->next=new_node;
    }
    else {
        *q=new_node;
        (*q)->next=0;
    }
}
int main() {
    create_list();
    display(q);

    getch();
    return 0;
}