-
-
-
Stack.rar
this is the lab that shows how to convert the infix number to postfix and also calculate them
-
-
-
Zada4a1.zip
A simple realization for stack with structure
-
-
-
-
stack.rar
假设一个算术表达式中可以包括三种括号:圆括号“(”和“)”,方括号“[”和“]”和花括号“{”和“}”且这三种括号可以按任意的次序嵌套使用(如:…[…{…}…[…]…]…[…]…(…)…)。编写判别给定表达式中所含括号是否正确配对出现的算法(已知表达式已存入数据元素为字符的顺序表中)
-
-