목차
StackQueue
[Debug]
StackQueue.exe
StackQueue.ilk
StackQueue.obj
StackQueue.pch
StackQueue.pdb
vc60.idb
vc60.pdb
StackQueue.cpp
StackQueue.dsp
StackQueue.dsw
StackQueue.ncb
StackQueue.opt
StackQueue.plg
1.20MB
파일 13, 폴더 1
[Debug]
StackQueue.exe
StackQueue.ilk
StackQueue.obj
StackQueue.pch
StackQueue.pdb
vc60.idb
vc60.pdb
StackQueue.cpp
StackQueue.dsp
StackQueue.dsw
StackQueue.ncb
StackQueue.opt
StackQueue.plg
1.20MB
파일 13, 폴더 1
본문내용
StackQueue.cpp
#include
#include
#define TRUE 1
#define FALSE 0
typedef struct node {
short number;
struct node *next;
} node;
node *Init_Node();
node *Make_Node();
void Print_Node(node *);
short Input_Node(node *, short);
short Output_Stack_Node(node *);
short Output_Queue_Node(node *);
void Free_Node(node *);
void main() {
short node_deep = 0, check, node_number;
node *head;
while (TRUE) {
printf(" -- input number --\n");
printf("Stack : 1\nQueue : 2\nStack & Queue : 3\nExit : -1\n-> ");
scanf("%d", &check);
switch (check) {
case -1:
break;
case 1:
node_deep = 0;
head = Init_Node();
while (TRUE) {
printf("\n\n--- Stack ---\n");
printf("Print : 1\nInput : 2\nOutput : 3\nExit : -1\n-> ");
#include
#include
#define TRUE 1
#define FALSE 0
typedef struct node {
short number;
struct node *next;
} node;
node *Init_Node();
node *Make_Node();
void Print_Node(node *);
short Input_Node(node *, short);
short Output_Stack_Node(node *);
short Output_Queue_Node(node *);
void Free_Node(node *);
void main() {
short node_deep = 0, check, node_number;
node *head;
while (TRUE) {
printf(" -- input number --\n");
printf("Stack : 1\nQueue : 2\nStack & Queue : 3\nExit : -1\n-> ");
scanf("%d", &check);
switch (check) {
case -1:
break;
case 1:
node_deep = 0;
head = Init_Node();
while (TRUE) {
printf("\n\n--- Stack ---\n");
printf("Print : 1\nInput : 2\nOutput : 3\nExit : -1\n-> ");
소개글