연결 스택과 연결 큐 삽입 삭제 cpp

1. 소스코드

data(value), next(nullptr) {}}; class LinkedStack {privateNode top; publicLinkedStack top(nullptr) {} ~LinkedStack{while (!isEmpty()) {pop();}} void push(int value) {Node newNode = new Node(value);newNode-`next = top;top = newNode;} void pop{if (isEmpty()) {stdcout `` `Stack is empty. Cannot pop. endl;return;}Node temp = top;top = top-`next;delete temp;} bool isEmpty{return top nullptr;} void printStack{Node current = top;while (current) {stdcout `` current-`data `` ` `;current = current-`next;}stdcout `` stdendl;}}; class LinkedQueue {privateNode front;Node rear; publicLinkedQueue front(nullptr), rear(nullptr) {} ~LinkedQueue{while (!isEmpty()) {dequeue();}} void enqueue(int value) {Node newNode = new Node(value);if (isEmpty()) {front = rear = newNode;} else {rear-`next = newNode;rear = newNode;}} void dequeue{if (isEmpty()) {stdcout `` `Queue is empty. Cannot dequeue. endl;return;}Node temp = front;front = front-`next;delete temp; if (front nullptr) {rear = nullptr;}…