12 d
= (deque
*)malloc(sizeof(deque
));
20 deque
*enq(state_t
*s
, deque
*d
)
23 d
->rear
= (node_t
*)malloc(sizeof(node_t
));
29 node_t
*temp
= (node_t
*)malloc(sizeof(node_t
));
42 node_t
*front_tmp
= d
->front
;
44 if (front_tmp
!= NULL
){
45 front_tmp
= front_tmp
->ptr
;
48 else if (front_tmp
!= NULL
) {
58 if (d
->front
!= NULL
&& d
->rear
!= NULL
) return 1;
62 state_t
*get_front(deque
*d
)
64 if (isEmpty(d
) == 1) return d
->front
->s
;