DynamicStructure002.cpp

#include <fstream>
#include <iostream>

using namespace std;

struct Node
{
    float x;
    Node* prev;
    Node* next;
};

typedef Node* pnode;

void addFirst(pnode &first, float a)
{
    pnode p;
    p = new Node;
    p->x = a;
    p->next = nullptr;
    p->prev = nullptr;

    first = p;
}

void push(pnode &p, float a)
{
    pnode q = new Node;
    q->next = nullptr;
    q->prev = p;
    q->x = a;
    p->next = q;

    p = q;
}

void unshift(pnode &first, float a)
{
    pnode p = new Node;

    p->next = first;
    p->prev = nullptr;
    p->x = a;

    first->prev = p;
    first = p;
}

void add(pnode &p, float a)
{
    pnode q = new Node;
    
    q->next = p->next;
    q->prev = p;
    q->x = a;

    p->next->prev = q;
    p->next = q;

    p = q;
}

void padd(pnode &p, float a)
{
    pnode q = new Node;

    q->next = p;
    q->prev = p->prev;
    q->x = a;

    p->prev->next = q;
    p->prev = q;

    p = q;
}

float deleteNode(pnode &p)
{
    pnode q;
    float a;

    q = p;

    p->prev->next = p->next;
    p->next->prev = p->prev;
    a = p->x;
    p = q->prev;
    
    delete q;

    return a;
}

float pop(pnode &first)
{
    pnode p = first;
    float a = first->x;

    p->next->prev = nullptr;
    first = p->next;

    delete p;

    return a;
}

void readList(pnode first)
{
    pnode p = first;
    while (p != nullptr) {
        cout << p->x << "; ";
        p = p->next;
    }

    cout << endl;
}