havefun77612 / datastructure Goto Github PK

}


void Firstinsert(Node* head, int a) {
	head->entry = a;
	head->next = NULL;

}
void newinsert(int a, Node *&head) {
	Node *p = new Node;
	p->entry = a;
	p->next = NULL;
	Node *q = head;
	while (q != NULL) {
		if (q->next == NULL) {
			q->next = p;
			return;
		}
		q = q->next;
	}
}

bool deletenode(Node *p, Node *&head) {
	if (p == NULL) {
		cout << "the node you wanna to delet is not found";
		return false;
	}
	if (p == head) {
		head = p->next;
		delete p;
		cout << "we have delete the first node succefully";
		return true;

	}
	Node *q = head;
	while (q) {
		if (q->next == p) {
			q->next = p->next;
			delete p;
			return true;
		}
		q = q->next;
	}
	return false;
}

}

void enqueue(int data) {

	node *p = new node;
	if (size == 0) {
		front = p;
		last = p;
	}
	p->entery = data;
	p->next = last->next;
	last->next = p;


	last = p;
	size++;
}

void dequeue() {
	node *q;
	q = front;
	if (size != 0) {
		front = q->next;
		int num = q->entery;
		delete q;
		size--;
		cout << num << endl;
	}
}
void display() {
	node *p;
	p = front;
	for (int i = 1; i <= size; i++) {
		cout << p->entery << endl;
		p = p->next;

	}
	cout << endl;







}

stack() {
	siez = 0;
	head = NULL;
}
bool isemputy() {
	if (siez == 0) return true;
	else return false;

}
int resiez() {
	return siez;
}

void push(int a) {
	node *p = new node;
	p->entery = a;
	p->next = head;
	head = p;

	siez++;
}

void pop() {
	node *q = new node;
	q = head;
	head = q->next;
	cout << q->entery << endl;
	delete q;
	siez--;
}

void display() {
	node *q = new node;
	q = head;
	for (int i = 0; i < siez; i++) {
		cout << q->entery << " ";
		q->next = q->next->next;

	}
	cout << endl;
}