liste recap

#include <iostream>
#include <fstream>

using namespace std;

ifstream f("date.in");

struct nod
{
    int info;
    nod *urm;
};

nod *prim;

void creare()
{
    int x;
    nod *p,*nou;

    while (f>>x)
        if (prim==NULL)
    {
        prim=new nod;
        prim->info=x;
        p=prim;
    }
    else
    {
        nou=new nod;
        nou->info=x;
        p->urm=nou;
        p=nou;
    }
    p->urm=NULL;
}

void afis()
{
    nod *p=prim;
    while (p)
    {
        cout<<p->info<<" ";
        p=p->urm;
    }
}

void inserare() // INSERARE DUPA primul nod
{
    nod *p=prim,*nou;
    int x=69;

    while (p->info!=2 && p->urm)
        p=p->urm;
    nou=new nod;
    nou->info=69;
    nou->urm=p->urm;
    p->urm=nou;
}

void inserare2() // inserare dupa fiecare nod
{
    nod *p=prim,*nou;
    int x=69;

    while (p->urm)
    {
        if (p->info%2==0)
        {
            nou=new nod;
            nou->info=x;
            nou->urm=p->urm;
            p->urm=nou;
        }
        p=p->urm;
    }
}

void sterge() // sterge toata nodurile
{
    nod *p=prim,*r,*q;
    while (p)
    {
        if (p->urm->info%2==0)
        {q=p->urm;
        r=p->urm->urm;
        p->urm=r;
        delete q;
        }
        p=p->urm;
    }
}


void inserare_ultim()
{
  nod *p=prim,*nou;
  while (p->urm)
        p=p->urm;

  nou=new nod;
  nou->info=69;
  p->urm=nou;
  nou->urm=NULL;
}

void inserare_inainte()
{
    nod *p=prim,*nou;
    nou=new nod;
    nou->info=69;
    nou->urm=prim;
    prim=nou;
}

void sterge_prim()
{
    nod *p=prim;
    prim=prim->urm;
    delete p;
}

void sterge_ultim()
{
    nod *p=prim,*q;
    while (p->urm->urm)
        p=p->urm;
    q=p->urm;
    delete q;
    p->urm=NULL;
}

int main()
{
    creare();
    sterge_ultim();
    afis();
    return 0;
}