ingbeeni

#include #include typedef int element; typedef struct QueueNode{ element item; struct QueueNode *link; }QueueNode; typedef struct { QueueNode *front,*rear; }QueueType; void error(char *message); void init(QueueType *q); int is_empty(QueueType *q); void enqueue(QueueType *q,element item); element dequeue(QueueType *q); //void display_linked_queue(QueueType *q); int main(void){ QueueType q; init(&..

#include #include #define MAX_QUEUE_SIZE 6 typedef int element; typedef struct{ element queue[MAX_QUEUE_SIZE]; int front,rear; }QueueType; // void init(QueueType *q); int is_empty(QueueType *q); int is_full(QueueType *q); void enqueue(QueueType *q,element item); element dequeue(QueueType *q); void display_queue(QueueType *q); int main(void){ QueueType q; init(&q); enqueue(&q, 1); enqueue(&q, 2);..

#include #include #include #define TRUE 1 #define FALSE 0 #define MAX_STACK_SIZE 100 typedef char element; typedef struct{ element stack[MAX_STACK_SIZE]; int top; }StackType; void init(StackType *s){ s->top = -1; } int is_empty(StackType *s){ return (s->top == -1); } int is_full(StackType *s){ return (s->top == (MAX_STACK_SIZE-1)); } void push(StackType *s,element item){ if( is_full(s)){ fprintf..

#include; #include; #include; #define TRUE 1 #define FALSE 0 #define MAX_STACK_SIZE 100 typedef char element; typedef struct{ element stack[MAX_STACK_SIZE]; int top; }StackType; void init(StackType *s){ s->top = -1; } int is_empty(StackType *s){ return (s->top == -1); } int is_full(StackType *s){ return (s->top == (MAX_STACK_SIZE-1)); } void push(StackType *s,element item){ if( is_full(s)){ fpri..

#include #include #include typedef int element; typedef struct link{ element data; struct link *link; }stack; typedef struct pstack{ stack *top; }thead; int is_empty(thead *s); void init(thead *s); void push(thead *s,element data); element pop(thead *s); element peek(thead *s); void display(thead *s); int main(void){ thead stack1; thead *p1 = &stack1; int i,n; init(p1); printf("숫자너어라\n"); scanf(..

#include #include #include typedef int element; typedef struct link{ element data; struct link * link; }stack; typedef struct top{ stack * top; }linkstack; void init(linkstack *s){ s -> top = NULL; } int is_empty(linkstack *s){ return (s->top == NULL); } void push(linkstack *s, element data){ stack *temp = (stack *)malloc(sizeof(stack)); if( temp == NULL){ fprintf(stderr,"MEMORY OMITTED"); retur..

When HTML 에디터 모드에서 이 사이에 코드를 작성하면 된다.

#include #include typedef int element; typedef struct Dlist{ element data; struct Dlist * Llink; struct Dlist * Rlink; }nnode; void error (char * sentence){ fprintf(stderr,"%s\n",sentence); exit(1); } void init(nnode * head){ head ->Llink = head; head ->Rlink = head; } void insert_nnode (nnode * phead, nnode * new_node){ new_node -> Llink = phead; new_node -> Rlink = phead -> Rlink; phead ->Rlin..

#include #include typedef int element; typedef struct list{ element data; struct list *link; }node; typedef struct listhead{ node *headlink; }headnode; void init(headnode *head){ head->headlink = NULL; } void error(char *sentence){ fprintf(stderr, "%s", sentence); exit(1); } void display(headnode *head){ headnode *p1 = head->headlink; if (p1!= NULL){ printf("%d->", p1->headlink ->data); display(..

/* * ddd.c * * Created on: 2014. 4. 16. * Author: CSE */ #include #include #include #include typedef int element;typedef struct DlistNode {element data;struct DlistNode *llink;struct DlistNode *rlink;}DlistNode; void init(DlistNode *phead){phead->llink = phead;phead->rlink = phead;} void display(DlistNode *phead){DlistNode *p;for(p=phead -> rlink; p != phead ; p = p->rlink){printf("%d ->",p->dat..