Scribd Logo
Upload

Welcome to Scribd!

  • 29 views

    Operatii Asupra Listei Liniare Simplu Inlantuit2

    Uploaded by

    Mincu_Marinela
    This document describes functions for creating and manipulating a singly linked list data structure in C. It defines a node struct with a key and data, includes header files, and declares global pointers. It then defines functions for inserting a node at the beginning of the list, inserting a node at the end, printing the list, creating an initial list by calling the beginning and end insertion functions, and a main function with a menu to call the other functions.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Operatii Asupra Listei Liniare Simplu Inlantuit2

    Uploaded by

    Mincu_Marinela
    29 views5 pages
    This document describes functions for creating and manipulating a singly linked list data structure in C. It defines a node struct with a key and data, includes header files, and declares global pointers. It then defines functions for inserting a node at the beginning of the list, inserting a node at the end, printing the list, creating an initial list by calling the beginning and end insertion functions, and a main function with a menu to call the other functions.

    Original Description:

    Operatii asupra Listei Liniare Simplu Inlantuit2

    Original Title

    Operatii asupra Listei Liniare Simplu Inlantuit2

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document describes functions for creating and manipulating a singly linked list data structure in C. It defines a node struct with a key and data, includes header files, and declares global pointers. It then defines functions for inserting a node at the beginning of the list, inserting a node at the end, printing the list, creating an initial list by calling the beginning and end insertion functions, and a main function with a menu to call the other functions.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    29 views5 pages

    Operatii Asupra Listei Liniare Simplu Inlantuit2

    Uploaded by

    Mincu_Marinela
    This document describes functions for creating and manipulating a singly linked list data structure in C. It defines a node struct with a key and data, includes header files, and declares global pointers. It then defines functions for inserting a node at the beginning of the list, inserting a node at the end, printing the list, creating an initial list by calling the beginning and end insertion functions, and a main function with a menu to call the other functions.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 5

    /* Operatii asupra Listei Liniare Simplu Inlantuite */

    #include <stdio.h>

    #include <conio.h>

    #include <ctype.h>

    #include <alloc.h>

    #include <string.h>

    struct NOD

    int cheie;

    char info[10];

    struct NOD *urm;

    };

    typedef struct NOD Tnod;

    typedef Tnod *ref;

    ref prim;

    ref q,r;

    void ins_prim(void)

    q=malloc(sizeof(Tnod));

    printf("Introduceti cheia: ");

    scanf("%d",&q);

    printf("Introduceti informatia: ");

    fflush(stdin); scanf("%s",q->info);
    q->urm=NULL;

    prim=q;

    } /* ins_prim */

    void ins_cs(void) /* Insereaza un NOD in spatele listei */

    r=malloc(sizeof(Tnod));

    printf("Introduceti cheia: ");

    scanf("%d",&r->cheie);

    printf("Introduceti informatia: ");

    fflush(stdin); scanf("%s",r->info);

    r->urm=NULL;

    q->urm=r;

    q=r;

    } /* ins_cs */

    void listare(void)

    if(prim == NULL)

    printf("Lista este vida !!! \n");

    else

    clrscr();

    printf("\nElementele listei sunt : ");

    r=prim;

    while(r!=NULL)

    {
    printf("\nCheia : %d", r->cheie);

    printf("\nInformatia: %s", r->info);

    r=r->urm;

    } /* Listare */

    void creare(void)

    char c;

    prim=NULL;

    ins_prim();

    while(c=='D')

    ins_cs();

    listare();

    printf("Continuati ?! [D/N] : ");

    fflush(stdin); scanf("%c",&c); c=toupper(c);

    }/* Creare */

    void main(void)

    char op;

    char c;

    prim=NULL;

    clrscr();
    do

    clrscr();

    printf("\t\tOperatii asupra Listei Liniare Simplu Inlantuite\n\n");

    printf("C - Crearea listei.\n");

    printf("V - Crearea primului NOD. \n");

    printf("A - Adaugare la sfarsitul listei.\n");

    printf("L - Listare. \n");

    printf("E - Exit !! \n");

    printf("\n\tIntroduceti optiunea : ");

    fflush(stdin);scanf("%s",&op); op=toupper(op);

    printf("\n");

    switch(op)

    case 'V': ins_prim();

    break;

    case 'C': creare();

    break;

    case 'A': ins_cs();

    listare();

    break;

    case 'L': listare();

    break;

    case 'E': break;

    default : printf("Optiunea e gresita!\n");

    getch();

    break;
    }

    }while(op!='E');

    } /* MAIN */

    You might also like