forked from 4ndres4ngarita/Data-Structures
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue.c
More file actions
93 lines (82 loc) · 1.5 KB
/
Queue.c
File metadata and controls
93 lines (82 loc) · 1.5 KB
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
81
82
83
84
85
86
87
88
89
90
91
92
93
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/*
#include <stdio.h>
#include <stdlib.h>
typedef struct node{
int dato;
struct node *sgte;
}*nodo, tipoNodo;
typedef struct{
nodo top;
nodo root;
}*cola, tipoCola;
nodo crearNodo(int);
cola crearCola();
void encolar(int, cola);
int desencolar(cola);
int empty(cola);
int size(cola);
int top(cola);
int main()
{
return 0;
}
nodo crearNodo(int valor)
{
nodo item = (nodo) malloc(sizeof(tipoNodo));
item->dato = valor;
item->sgte = NULL;
return item;
}
cola crearCola()
{
cola Queue = (cola) malloc(sizeof(tipoCola));
Queue->top = NULL;
Queue->root = NULL;
return Queue;
}
void enqueue(int valor, cola Queue)
{
if(Queue -> root == NULL){
nodo elemento = crearNodo(valor);
Queue -> top = elemento;
Queue -> root = elemento;
}else{
nodo elemento = crearNodo(valor);
elemento -> sgte = NULL;
Queue -> top -> sgte = elemento;
Queue -> top = elemento;
}
}
int dequeue(cola Queue)
{
int info;
if (!empty(Queue))
{
nodo item = Queue->root;
info = item->dato;
Queue->root = item->sgte;
free(item);
}else{
info = -123;
}
return info;
}
int empty(cola Queue)
{
return(Queue->root == NULL);
}
int size(cola Queue){
int contador = 0;
nodo actual = Queue->root;
while (actual != NULL){
contador++;
actual = actual->sgte;
}
return contador;
}
*/