void insertAtTail(node *&head, int d)
{
if (head == NULL)
{
head = new node(d);
}
else
{
node *tail = head;
while (tail != NULL)
{
tail = tail->next;
}
node *new_node = new node(d);
tail ->next= new_node;
new_node->prev = tail;
tail = new_node;
// node *new_node = new node(d);
// tail->next = new_node;
// new_node->prev = tail;
// tail = new_node;
}
}