배우고픈 공돌이

list.h #ifndef LIST_H#define LIST_H typedef struct node{struct node* next;}node_t; typedef struct {node_t *ptr;int element_size;}list_t; void initList(list_t *pListi, int element_size);void cleanupList(list_t *pList);void printList(const list_t *pList,void (*print)(const void*)); void insertFirstNode(list_t *pList, const void *pData);void insertNode(list_t *pList, const void *pPrevData, const vo..

queue.h #ifndef QUEUE_H#define QUEUE_H class Queue{private:int* pArr;int rear;int front;int size;public:Queue(int size);~Queue();void push(int data);int pop();}; #endif queue.cpp #include "queue.h"#include Queue::Queue(int size){//this-> pArr = (int*) malloc(sizeof(int)*size);this->pArr = new int[size];assert( this->pArr ); this-> size = size;this-> front =0;this-> rear = 0; } Queue::~Queue(){//..

stack.h #ifndef STACK_H#define STACK_H class Stack{private://information hidingint* pArr;int tos;int size;public:Stack(int size);//void initStack(int size);~Stack();//void cleanupStack();void push(int data);int pop();}; #endif stack.cpp #include "stack.h"#include Stack::Stack(int size){//this-> pArr = (int*) malloc(sizeof(int)*size);this-> pArr = new int[size];assert( this->pArr ); this-> size =..