Двухсторонняя очередь, relocate

#include <iostream>
#include <cstdlib>
#include <conio.h>
#include <math.h>
using namespace std;
#define length 8
class dequeue
    {   int s[length];
        int bottom, top;
    private: int g;
public: 
        void reset() {top = bottom = length/2; top--;
        for (int i=0;i<=length;i++) {s[i]=0;}}  
void push_t(int x);
void out_stack ();
void relocate();
~dequeue();
};
void dequeue::push_t (int x){
    if (top>0) 
    {s[top]=x;
    top--;
    g=top;;
} else{printf("Vylezli za predely ocheredi ");}
for (int i=0;i<=length;i++) cout<<s[i];printf("\n"); g=top;}
 
void dequeue::out_stack(){
    int i=length;
    cout<<"Out stack  ";
    for (i=length-1;i>=0;i--)   
        cout<<s[i];g=top;
    }
 
void dequeue::relocate(){
    int i;
    printf("\n");
if (top==0 || bottom==0) {
    cout<<" RELOCATE FALSE";}
else { cout<<"RELOCATE TRUE "; for (i=length-1;i>=0;i--)    
        cout<<s[i];
};
}
 
 dequeue::~dequeue(void){
     printf("\n");
    cout<<"Unuchtozhenie"<<endl;
}
void main()
{
    setlocale(LC_ALL, ".ACP");
    cout<<"Программа"<<endl;
    dequeue newq;
    newq.reset();
    newq.push_t(5);
    newq.push_t(7);
    newq.push_t(4);
    newq.out_stack();
    newq.relocate();
    newq.~dequeue();
 
_getch();
}