ingbeeni

#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..

#include #include typedef int element; typedef struct node_list { element data; struct node_list * p; }node; void error(char * sentence){ fprintf(stderr, "%s \n", sentence); exit(1); } //when inserting betweet phead and node, Needing address of phead. node *create_node(node * head, node * phead, element data){ node *new_node = NULL; new_node = (node *)malloc(sizeof(node)); if (new_node == NULL){..

#include #include typedef int element; typedef struct node { element data; struct node * link ; }node; void error(char *message){ fprintf(stderr,"%s /n",message); exit(1); } node *create_node(element data, node * link){ node *new_node; new_node = (node *)malloc(sizeof(node)); if(new_node == NULL) error("MALLOC ERROR"); new_node -> data = data; new_node -> link = link; return (new_node); } void d..

http://orwelldevcpp.blogspot.kr/2014/03/dev-c-562-released.html

#include #include typedef int element; typedef struct list{ element data; struct list * link; } list; void create_node(list *head_node , list * pre_node, list * new_node, element data){ new_node = (list *)malloc(sizeof(list)); if(new_node == NULL){ error("error"); } new_node->data = data; new_node->link = NULL; if(head_node == NULL){ pre_node->data = data; pre_node->link = head_node; head_node=p..