|
struct{// Queue의구조체정의
listPointer qFront;
listPointer qRear;
} Queue;
void initQueue(Queue *Q);
boolean isEmpty(Queue* Q);
void addQueue(Queue *Q, element Data);
element deleteQueue(Queue *Q);
int getQueueLength(Queue *Q);
void printQueue(Queue *Q); 9주 - Stack & Queue using Link
|
|
|
|
stack */
precedence operatorStack[MAX_STACK_SIZE];
/* precedence 지정*/
int InStackPrecedence[11] = {0,19,18,18,14,13,13,13,12,12,0};
int InComingPrecedence[11] = {20,19,18,18,15,13,13,13,12,12,0};
void getInfix(char infixExpr[]);
void infixToPostfix(char infixExpr[], char postfixExpr[]);
v
|
|
메뉴펼치기
