#include <iostream>

using namespace std;

class node {
int data;
node* next;
node* pre;
public:

node()
{
data = 0;
next = NULL;
pre = NULL;
}
int getdata()
{
return data;
}
void setdata(int x)
{
data = x;
}
node* getnext()
{
return next;
}
void setnext(node *n)
{
next = n;
}
node* getprev()
{
return pre;
}
void setprev(node *n)
{
pre = n;
}

};

class doubly_list
{
node* head, *tail;
public:
doubly_list()
{
head = tail = NULL;
}
void insert_at_Front()
{
node* newnode = new node;
int d;
cout << "Enter a number" << endl;
cin >> d;
newnode->setdata(d);
newnode->setnext(NULL);
 newnode->setprev(NULL);
if (head == NULL)
{
head = newnode;
tail = newnode;
cout << "Node Added at front" << endl;
}
else
{
newnode->setnext(head);
newnode->setprev(NULL);
head = newnode;
}
}
void insert_at_End() {
node* newnode = new node;
int d;
cout << "Enter a number" << endl;
cin >> d;
newnode->setdata(d);
newnode->setnext(NULL);
newnode->setprev(NULL);

if (head == NULL) {
head = newnode;
tail = newnode;
cout << "Node added at End" << endl;
}
else {

newnode->setprev(tail);
tail->setnext(newnode);
tail = newnode;
cout << "Node added at End" << endl;
}
}
void deleteFirstNode()
{
if (head == NULL)
{
cout << "List is empty" << endl;
}
else
{
node* newnode = new node;
newnode = head;
head = newnode->getnext();
newnode->setnext(NULL);
head->setprev(NULL);
}
}
void deleteEndNode()
{
if (head == NULL)
{
cout << "List is empty" << endl;
}
else
 {
node* newnode = head;
while (newnode->getnext() != tail)
{
newnode = newnode->getnext();
}
newnode->setnext(NULL);
tail->setprev(NULL);
tail = newnode;
}
}
void search()
{
//previous lectures........
}
void display()
{
node* temp = head;
while (temp != NULL)
{
cout << "Data=" << temp->getdata() << endl;
temp = temp->getnext();
}
}
};

int main()
{
int ch = 0;
doubly_list dll;

while (ch != 7)
{
cout << "Plz enter your choice:" << endl;
cout << "1. Add Node at Front" << endl;
cout << "2. Add Node at End" << endl;
cout << "3. Delete First Node" << endl;
cout << "4. Delete End Node" << endl;
cout << "5. Search" << endl;
cout << "6. Display" << endl;
cout << "7. Exit" << endl;
cin >> ch;
switch (ch)
{
case 1:
dll.insert_at_Front();
break;
case 2:
dll.insert_at_End();
break;
case 3:
dll.deleteFirstNode();
break;
case 4:
dll.deleteEndNode();
break;
case 5:
dll.search();
 break;
case 6:
dll.display();
break;

}
}
}