Создание базы данных

#ifndef STACK_H_INCLUDED
#define STACK_H_INCLUDED
 
class Stack
{
private:
    double *items;
    int top;
    int size;
    int maxsize;
 
public:
    Stack(int max);
    ~Stack();
    int sizeRe();
    int maxsizeRe();
    bool empty();
    bool full();
    bool push(const double &value);
    bool pop();
    void print();
};
 
#endif
 
 
#include "stack.h"
#include <iostream>
 
using namespace std;
 
Stack::Stack(int max)
{
    maxsize=max;
    top=maxsize;
    items=new double[maxsize];
    size=0;
}
 
Stack::~Stack()
{
    delete[] items;
}
 
int Stack::sizeRe()
{
    return size;
}
 
int Stack::maxsizeRe()
{
    return maxsize;
}
 
bool Stack::empty()
{
    return size==0;
}
 
bool Stack::full()
{
    return size==maxsize;
}
 
bool Stack::push(const double &value)
{
    if(full());
    return false;
    items[top]=value;
    top--;
    size++;
    return true;
}
 
bool Stack::pop()
{
    if(empty())
    return false;
    top++;
    size--;
    return true;
}
 
void Stack::print()
{
 
}

#ifndef LIST_H
#define LIST_H
 
#include <iostream>
 
using namespace std;
 
class Node
{
public:
double data;
Node *next;
 
Node()
{
data=0;
next=0;
}
Node(double &data,Node *next=0)
{
this->data=data;
this->next=next;
}
};
 
class List
{
Node* head;
int nodes;
 
public:
List()
{
head=0;
nodes=0;
}
int size()
{
return nodes;
}
 
bool empty()
{
return nodes==0;
}
Node *create(double value)
{
head = new Node (value);
nodes++;
return head;
}
 
Node *ins(double value,Node *where)
{
Node *insNode;
insNode=new Node (value);
insNode->next=where->next;
where->next=insNode;
nodes++;
return insNode;
}
 
void remove(Node *where)
{
if(nodes>1 && where->next!=0)
{
Node *temp=new Node;
temp=where->next;
where->next=where->next->next;
delete temp;
nodes--;
}
}
 
void clear()
{
if(nodes==0)
cout«"deleted";
Node *pNode=head;
while(pNode->next!=0 && nodes !=1)
{
remove(pNode);
}
delete pNode;
 
nodes--;
}
 
void print()
{
if(nodes==0)
cout«"List's empty";
else
{
Node *pNode=head;
for(int i=0;i<nodes;i++)
{
cout«"data = "«pNode->data«" next ="«pNode->next«endl;
pNode=pNode->next;
}
}
}
 
};
 
#endif