Liste1

#include <iostream>



using namespace std;



struct elev{

    char nume[20];

    int h;

    elev *leg;

}*v[100];

int main()

{

    int n;

    cout<<"n="; cin>>n;

    for (int i=n-1; i>=0; i--){

        v[i]=new elev;

        cout<<"Elev: "<<i+1<<endl;

        cout<<"Nume: "; cin>>v[i]->nume;

        cout<<"H: "; cin>>v[i]->h;

        if (i==(n-1)) v[i]->leg=NULL;

        else v[i]->leg=v[i+1];

    }

    elev *p=new elev;

    p=v[0];

    while(p){

        cout<<p->nume<<", "<<p->h<<endl;

        p=p->leg;

    }

    //inserare 2/3

    cout<<"Introdu datele elevului nou:"<<endl;

    elev *elev_nou=new elev;

    cout<<"Nume: "; cin>>elev_nou->nume;

    cout<<"H: "; cin>>elev_nou->h;

    v[1]->leg=elev_nou;

    elev_nou->leg=v[2];

    p=v[0];

    cout<<"Lista dupa inserare:"<<endl;

    while(p){

        cout<<p->nume<<", "<<p->h<<endl;

        p=p->leg;

    }

    //stergere penultimul nod

    v[n-3]->leg=v[n-1];

    delete v[n-2];

    //dupa stergere:

    p=v[0];

    while(p){

        cout<<p->nume<<", "<<p->h<<endl;

        p=p->leg;

    }

    return 0;

}