data-structure-cpp/queue_pointer.cpp at master · IFPABelem/data-structure-cpp · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <iostream>
#include <locale.h>
#include <cstdlib>

using namespace std;

typedef float Data;

typedef struct Queue{
	Data value;
	Queue *next;
}Queue;

typedef Queue *ptqueue;

typedef struct Desc{
	ptqueue front;
	ptqueue end;
}Desc;


void insert(Desc &q, Data val){
	ptqueue temp;
	temp = new Queue;
	temp->value = val;
	temp->next = NULL;

	if(q.front == NULL)
		q.front = temp;

	else
		q.end->next = temp;

	q.end = temp;
}

void remove(Desc &q, bool &ok){
	if(q.front == NULL)
		ok = false;
	else{
		q.front = q.front->next;
		if(q.front == NULL)
			q.end = NULL;
	}

}

void print_queue(Desc q, bool &ok){
	if(q.front == NULL)
		ok = false;
	else{
		while(q.front != NULL){
			cout << q.front->value << "  ";
			q.front = q.front->next;
		}
		cout << "\n" << endl;
	}
}

main(){
	setlocale(LC_ALL, "Portuguese");
	Desc queue;
	queue.front = NULL;
	queue.end = NULL;

	bool ok = true;

	insert(queue, 10);
	insert(queue, 20);
	insert(queue, 30);

	remove(queue, ok);
	remove(queue, ok);
	remove(queue, ok);

	print_queue(queue, ok);

	system("Pause");
}