알고리즘28 Queue C++ 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 #include using namespace std; class Queue { private: int size; int front; int rear; int* q; public: Queue() { size = 10; front = rear = -1; q = new int[size]; } Queue(int size) { this->size = size; fr.. 2022. 11. 7. Queue 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 91 92 93 94 95 96 97 98 #include using namespace std; struct Queue { int size; int front; int rear; int* q; }; void create(Queue& q, int .. 2022. 11. 7. Link stack 최종 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 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 12.. 2022. 10. 30. Link stack C++ 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 #include using namespace std; class Node { private: int data; Node* next; public: void push(int x); int pop(); void Display(); }*top=NULL; void Node::push(int x) { Node* t = new Node; if (t == NULL) cout next = top; top = t; } int Node:.. 2022. 10. 30. ADT stack 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 91 92 93 #include using namespace std; struct Stack { int size; int top; int* s; }; void create(Stack* st) { cout st->size; st->top = -1;.. 2022. 10. 30. c언어 stack 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859#includeusing namespace std; struct Node{ int data; Node* next;}*top=NULL; void push(int x){ Node* t; t = new Node; if (t == NULL) cout next = top; top = t; }}int pop(){ Node* t; int x = -1; if (top == NULL) cout data; delete t; } return x;}void Display(){ Node* p; p = top; while (p) { cout 2022. 10. 29. 이전 1 2 3 4 5 다음