stack(5)
-
자료구조_c언어_배열스택_arrayStack_05
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081#include #include #define MAX 5 int stack[MAX];int top = -1; void push(int data) { if (top + 1 == MAX) { printf("\n stack overflow!!!\n\n"); return; } else stack[++top] = data;} void pop() { if (top == -1) { printf("\n stack underflow!!!\n\n"); ..
2021.02.24 -
자료구조_c언어_배열스택_arrayStack_04
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118#include #include #include #define MAX_STACK_SIZE 100 typedef int element; typedef struct { element stack[ MAX_STACK_SIZE ]; int top;}StackType; int is_..
2021.02.04 -
자료구조_c언어_배열스택_arrayStack_03
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071#include #include #define MAX_STACK_SIZE 100 typedef int element;typedef struct { element stack[MAX_STACK_SIZE]; int top;}StackType; void push(StackType *s, element item);element pop(StackType *s); void init(StackType *s) { s->top = -1;} int is_empty(StackType *s) ..
2021.02.03 -
자료구조_c언어_배열스택_arrayStack_02
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374#include #include #define MAX_STACK_SIZE 100#define MAX_STRING 100 typedef struct { int student_no; char name[MAX_STRING]; char address[MAX_STRING];}element; void push(element item);element pop();element stack[MAX_STACK_SIZE];int top = -1; int is_empty() { re..
2021.02.02 -
자료구조_c언어_연결링크_linkedStack02
전에 작성한 연결링크 다음 연습니다. 옛날에 테스트하며 연습한거에요~ 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 #include #include struct Node { char name[50]; int price; struct Node *link; }; struct Node *top =..
2021.01.31