본문내용
Stack
{
stack = new T[MaxSize];
top = -1;
*stack = static_cast
}
template
void Stack
{
if (top == MaxSize-1) StackFull();
else stack[++top] = x;
}
template
T Stack
{
if (top == -1)
{
StackEmpty();
}
T x = stack[top--];
return x;
}
template
T Stack
{
if (top == -1)
{
return static_cast
}
return stack[top];
}
template
void Stack
{
for (int i = 0; i <= top; i++)
cout << i << ":" << stack[i] << endl;
}
void main()
{
int result;
Stack
Stack
cout << "중위표기식입력: ";
cin >> cstack;
postfix.Postfix();
result = calc.calcPostfix();
cout << "후위표기식변환: " << cstack << endl;
cout << "계산결과: " << result << endl;
}
2. 실행 결과
소개글