Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "lista.h"
- #include <iostream>
- using namespace std;
- PNod creare_rec(){
- TElem x;
- cin>>x;
- if (x==0)
- return NULL;
- else{
- PNod p=new Nod();
- p->e=x;
- p->urm=creare_rec();
- return p;
- }
- }
- Lista creare(){
- Lista l;
- l._prim=creare_rec();
- return l;
- }
- void tipar_rec(PNod p){
- if (p!=NULL){
- cout<<p->e<<" ";
- tipar_rec(p->urm);
- }
- }
- void tipar(Lista l){
- tipar_rec(l._prim);
- }
- void distrug_rec(PNod p){
- if (p!=NULL){
- distrug_rec(p->urm);
- delete p;
- }
- }
- void distrug(Lista l) {
- //se elibereaza memoria alocata nodurilor listei
- distrug_rec(l._prim);
- }
- Lista stergePrimul(Lista l){
- PNod aux = l._prim->urm;
- l._prim = aux;
- return l;
- }
- bool vid(Lista l){
- if(l._prim->e==NULL)
- return true;
- return false;
- }
- Lista adaugaPrimul(Lista l,int e){
- PNod n = new Nod();
- n->e = e;
- n->urm = l._prim;
- l._prim = n;
- return l;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement