#include <iostream>
using namespace std;
class queue
{
public:
queue();
queue(queue& str);
~queue();
void push(const int v);
void pop();
bool isempty() const;
private:
struct node
{
node* pPrev_;
node* pNext_;
int data_;
};
node* pHead_ = nullptr;
};
int main()
{
queue a;
return 0;
};
queue::queue() = default;
queue::~queue()
{
while (isempty())
{
pop();
}
}
void
queue::push(const int v)
{
node* pnew = new node;
pnew->pNext_ = pHead_;
pnew->data_ = v;
pHead_ = pnew;
}
bool
queue::isempty() const
{
return (nullptr == pHead_);
}
void
queue::pop()
{
}