Queue 응용 Queue 응용 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150 #include#include#include#define EMPTY 0 typede.. 더보기 LinkedList LinkedList 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105#include #include #include #define EMPTY 0 struct node{ int data; struct node *link;};typedef struct node linked; linked * get_node(){ linked *tail; tail = (linked *)malloc(sizeof(.. 더보기 Queue Queue - Node 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071#include #include #define EMPTY 0 typedef struct node{ int data; struct node * link;} queue; queue * get_node(){ queue * tmp; tmp = (queue *)malloc(sizeof(queue)); tmp->link = EMPTY; return tmp;} void enqueue(queue ** front, queue ** rear, int data){ q.. 더보기 이전 1 ··· 3 4 5 6 7 8 9 ··· 57 다음