Implement a data structure BucketArray. The implementation must be a class template. It must have the following features: stores representatives of class Pair. A pair is composed by two objects of any...

#include
using namespace std;
struct Node
{
    int data;
    Node *next, *prev;
    public:
    Node(int val)
    {
        data = val;
        next=nullptr;
        prev=nullptr;
    }
    friend class Deque;
};
class Deque
{
    Node *front;
    Node *rear;
    public:
    Deque();
    Deque(Deque ©);
    ~Deque();
    void operator = (Deque ©);
    void insertFront(int val);
    void insertBack(int val);
    int removeFront();
    int removeBack();
    int peekFront();
    int peekBack();
    bool empty();
    int size();
};
Deque::Deque()
{
    front=nullptr;
    rear=nullptr;
}
Deque::Deque(Deque ©)
{
    Node* curr=copy.front;
    if(curr==nullptr)
    return;
    front = new Node(curr->data);
    Node *temp = front;
    while(curr->next!=nullptr)
    {
        temp->next = new Node(curr->next->data);
        temp->next->prev = temp;
        curr = curr->next;
        temp = temp->next;
    }
    rear = temp;
}
Deque::~Deque()
{
    Node *temp=front;
    front=nullptr;
    Node *temp2;
    while(temp!=nullptr)
    {
        temp2=temp;
        temp=temp->next;
        delete(temp2);
    }
    rear = nullptr;
}
void Deque::operator=(Deque...