Double Circular Link List

#include<iostream>
using namespace std;
struct node{
	int data;
	node *next;
	node *prev;
};
node *head;
node *tail;
void Insert(int x){
	node *temp = new node;
	if (head == NULL){
		temp->data = x;
		temp->next = head;
		temp->prev = tail;
		head = temp;
		tail = temp;
	}
	else{
		temp->data = x;
		temp->next = head;
		temp->prev = tail;
		tail->next = temp;
		tail = tail->next;
	}
}
void InsertAtNth(int key,int val){
	node *temp = head;
	node *temp1 = head;
	node *newnode = new node;
	newnode->data = val;
	int count = 0;
	while (temp->next != head){
		if (temp->data != key){
			count = count++;
			temp = temp->next;
		}
		else{
			break;
		}
	}
	for (int i = 0; i < count + 1; i++){
		temp1 = temp1->next;
	}
	newnode->next = temp1;
	temp1->prev = newnode;
	temp->next = newnode;
	newnode->prev = temp;
}
void Search(int key){
	node *temp = head;
	while (temp->next != head){
		if (temp->data != key){
			temp = temp->next;
		}
		else{
			cout << "Found!!!\n";
			exit(0);
		}
	}
	cout << "Not Found!!! \n";
}
void DeleteNthNode(int key){
	node *temp = head;
	node *temp1 = head;
	node *tail = head;
	int count = 0;
	if (temp->data == key){
		while (tail->next != head){
			tail = tail->next;
		}
		temp = temp->next;
		head = temp;
		tail->next = tail->next->next;
		delete temp1;
		return;
	}
	while (temp->next != head){
		if (temp->data != key){
			temp = temp->next;
		}
		else{
			break;
		}
	}
	for (int i = 0; i < count - 1; i++){
		temp1 = temp1->next;
	}
	temp1->next = temp->next;
	temp->next->prev = temp1;
	delete temp;
}
void Print(){
	node *temp = head;
	do{
		cout << temp->data << endl;
		temp = temp->next;
	} while (temp!=head);
}
int main(){
	Insert(1);
	Insert(2);
	Insert(3);
	Insert(4);
	Insert(5);
	Print();
	DeleteNthNode(3);
	Print();
	Search(1);
	InsertAtNth(3,8);
	Print();
}