Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- typedef struct Queue
- {
- char Name[80], Phone[80], Email[80];
- struct Node *head;
- struct Node *next;
- } Queue;
- Node *front(Queue q);
- {
- if (q.head == NULL)
- return;
- return q.head;
- }
- void pop(Queue *q)
- {
- Node *tmp;
- if (q.head == NULL)
- {
- printf("ERROR\n");
- return;
- }
- Node *tmp = q.head;
- q.head = q.head->next;
- free(tmp);
- }
- void push(Queue *q)
- {
- Node *iterator;
- if (q.head == NULL)
- return;
- Node *iterator = q.head;
- while (iterator->next != NULL)
- {
- iterator = iterator->next;
- }
- iterator->next = p;
- return;
- }
- int main()
- {
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment