correzione_codice

pNode lastInsert(pNode top, int value)
{
    pNode app;
    if(top != NULL)
        top->next = lastInsert(top->next,value);
    else
    {
        app=(pNode)malloc(sizeof(node));
        app->info = value;
        app->next = NULL;
        return app;
    }
    return top;
}

void printList(pNode top)
{
    pNode app = top;
    while(app != NULL)
    {
       printf("%d -> ", app->info);
       app = app->next;
    }
    puts("NULL\n");
}