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