View difference between Paste ID: k7SFUBCL and D4pBCmPP

 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 sterg_inceput(nod *&prim, nod *&ultim)
+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;
     }
-void sterg_end(nod *&prim, nod *&ultim)
+    else {
 	p = prim;
 	while(p -> urm != NULL)
-    if(ultim)
+	    p = p -> urm;
-        if(prim == ultim) {
+	p -> urm = p -> urm -> urm;
-            delete prim;
+	delete q;
-            prim = ultim = NULL;
+
-        }
+
-        else {
+
-            p = prim;
+
-            while(p -> urm != ultim)
+
-                p = p -> urm;
+
-            p -> urm = NULL;
+
-            delete ultim;
+
-            ultim = p;
+
-        }
+
 
 void push(nod *&vf, int x)
 {
-void sterg_nod(nod *p, nod *&prim, nod *&ultim)
+
     p = new nod;
     p -> info = x;
-    if (p == prim)
+    p -> urm = vf;
-        sterg_inceput(prim, ultim);
+    vf = p;
-    else if(p == ultim)
+
-        sterg_end(prim, ultim);
+
 void pop(nod *&vf, int &x)
 {
-        q = p -> urm;
+    if(vf != NULL)
-        p -> info = q -> info;
+
-        p -> urm = q -> urm;
+	p = vf;
-        delete q;
+	x = p -> info;
 	cout << "info se va afisa" << x;
 	vf = p -> urm;
 	delete p;
     }
     else cout << " Nu exista niciun element in lista";
 }