SDA #3

#include <iostream>
using namespace std;

typedef struct _Element {
    int data;
    struct _Element* leg;
} Element;

void InsertFront(Element* &cap, int val) {
    Element* p = new Element;
    p = new Element;
    p->leg = cap; p->data = val;
    cap = p;
}

//void InsertMiddle(Element* &cap, int index, int val) {
//  Element* p = new Element;
//  p->leg = cap; p->data = val;
//  cap
//}

void create(Element* &cap) {
    int nr, elem;
    cout << "nr = "; cin >> nr;
    while (nr) {
        cin >> elem;
        InsertFront(cap, elem);
        nr--;
    }
}

void print(Element* cap) {
    while (cap != nullptr) {
        cout << cap->data;
        cap = cap->leg;
    }
    cout << endl;
}

void del(Element* cap) {
    Element* p = cap;
    cap = cap->leg;
    delete p;
}

int main() {
    Element* cap = nullptr;
    create(cap);
    InsertFront(cap, 2);
    print(cap);
    del(cap);
    print(cap);
    /*Element* p; Element* q;
    p->leg = q->leg;
    q->leg = p;*/
    return 0;
}

// l = l->leg; - parcurge normal lista
// r = r->leg->leg; - parcurge de 2x mai repede lista