Notes

#include "stack.h"
#include "queue.h"
#include <time.h>
//Available functions
int isStackEmpty(Stack* stk);
void push(Stack* stk, int x);
int pop(Stack* stk);
int peek(Stack* stk);
void enqueue(Queue* q, int x);
int dequeue(Queue* q);
int count(Queue* q);
int isQueueEmpty(Queue* q);
int isQueueFull(Queue* q);
void print(Queue* q);

int main() {
srandom(time(0));
Queue q = {0, 0};
for(int i=0; i < 10; ++i) enqueue(&q, random()%10);
Queue qEven = {0, 0}, qOdd = {0, 0};
printf("original queue: "); print(&q);

Stack s = {0};

//TODO: Reverse the elements of q using s (~ 4 lines)
while(!isQueueEmpty(&q)) push(&s,dequeue(&q));
while(!isStackEmpty(&s)) enqueue(&q,pop(&s));
//TODO ENDS

printf("reversed queue: "); print(&q);

//TODO: Remove each element from q and if the value is even add it to qEven otherwise add it to qOdd (~ 6 lines)
while(!isQueueEmpty(&q)) { int x = dequeue(&q);
if(x%2==0) enqueue(&qEven,x);
else enqueue(&qOdd,x);
}
//TODO ENDS

printf(" even elements: "); print(&qEven);
printf(" odd elements: "); print(&qOdd);

//TODO: Merge the elements back to the queue placing the even elements first (~ 4 lines)
while(!isQueueEmpty(&qEven)) enqueue(&q,dequeue(&qEven));
while(!isQueueEmpty(&qOdd)) enqueue(&q,dequeue(&qOdd));
//TODO ENDS

printf(" merged queue: "); print(&q);
while(!isQueueEmpty(&q)) dequeue(&q);

int counter = 0;
//TODO: Keep adding elements to q until the it is full. Use counter to keep track of total number of elements added. (~ 3 lines)
while(!isQueueFull(&q)){
++counter;
enqueue(&q,random()%10);
}
//TODO ENDS

printf("Added %d elements.n", counter);

return 0;

}