For this machine problem you are to write a stack class and a queue class.

Both are to be implementd by a circular doubly linked list.

In addition, your program should be written by suppling he missing class

methods. No changes to the given code are allowed. In each case the test

data is built into the program.

Here is the stack.

#include

#include

using namespace std;

class stack $\{$

private:

struct $\_$dlink$\{$

char value;

$\_$dlink $*$ prev, $*$ next;

$\}\_$base;

public:

stack$()$;

bool is$\_$empty$()$;

char pop$()$;

void push$($char$)$;

char top$()$;

$\}$;

$/*$ missing class methods go here. $*/$

int main$()\{$

stack stk;

stk$.$push$($a$)$;

stk$.$push$($b$)$;

$1$

stk$.$push$($c$)$;

stk$.$push$($d$)$;

while$(!$stk$.$is$\_$empty$())\{$

cout $<<$ stk$.$top$()<<$

$$;

cout $<<$ stk$.$pop$()<<$

$$;

cout $<<"$

$---------------------$

$"$;

$\}$

$\}$

And here is the queue.

#include

#include

using namespace std;

class queue$\{$

private:

struct $\_$dlink$\{$

char value;

$\_$dlink $*$ prev, $*$ next;

$\}\_$base;

public:

queue$()$;

bool is$\_$empty$()$;

char dequeue$()$;

void enqueue$($char$)$;

$\}$;

$/*$ missing class methods go here. $*/$

int main$()\{$

queue que;

$2$

que.enqueue$($a$)$;

que.enqueue$($b$)$;

que.enqueue$($c$)$;

que.enqueue$($d$)$;

while$(!$que.is$\_$empty$())\{$

cout $<<$ que.dequeue$()<<$

$$;

cout $<<"$

$---------------------$

$"$;

$\}$

$\}$

can u do write stack class and a queue class $2$ different code. so one code in stack class and one code in queue class.