O gramada de probleme inutile cu noduri

void inserare_fata(nod *&prim, int nr)
{
    nod *p = new nod;
    p -> info = nr;
    p -> urm = prim;
    prim = p;
}

void inserare_spate(nod *&prim, nod *&ultim, int nr)
{
    nod *p;
    p = new nod;
    p -> info = nr;
    p -> urm = NULL;
    if(ultim != NULL)
        ultim -> urm = p
    else
        prim = p;
    ultim = p;
}

void inserare_inainte(nod *p, nod *&prim, nod *&ultim, int nr)
{
    nod *q;
    q = new nod;
    q -> info = p -> info;
    p -> info = nr;
    q -> urm = p -> urm;
    p -> urm = q;
    if(p == ultim)
        ultim = q;
}

void inserare_dupa(nod *p, nod *&prim, nod *&ultim, int nr)
{
    nod *q;
    if(prim)
    {
        p = prim;
        prim = prim -> urm;
        delete p;
        if(prim == NULL)
            ultim = NULL;
    }
    else cout << "Lista vida.";
}

void stergere(nod *&q)
{
    nod *p = prim;
    if(p == q) {
    prim = p -> urm;
    delete q;
    }
    else if(ultim == q) {
    for(p = prim; p -> urm -> urm != NULL; p = p -> urm)
        ultim = p;
    ultim -> urm = NULL;
    delete q;
    }
    else {
    p = prim;
    while(p -> urm != NULL)
        p = p -> urm;
    p -> urm = p -> urm -> urm;
    delete q;
    }
}

void afisare_lista(nod *prim)
{
    nod *p;
    for(p = prim; p != NULL; p = p->urm)
        g << p -> info << " ";
    g << endl;
}

void push(nod *&vf, int x)
{
    nod *p;
    p = new nod;
    p -> info = x;
    p -> urm = vf;
    vf = p;
}

void pop(nod *&vf, int &x)
{
    if(vf != NULL)
    {
    p = vf;
    x = p -> info;
    cout << "info se va afisa" << x;
    vf = p -> urm;
    delete p;
    }
    else cout << " Nu exista niciun element in lista";
}