correct the mistakes of below code: #include #define SIZE 50 using namespace std; class stack{ int array[SIZE]; int top; public : stack(){ int top =-1; } bool isEmpty() { if (top == -1) return true; else return false; } bool isFull() { if(top == SIZE) return true; else return false; } void push(int value) { if(!isFull()) array [top++] = value; else{ cout << "Stack is Full "; } } int pop() { if(!isEmpty()) return array[top--]; else { cout << " Stack is Empty"; } } }; int main(){ int postfix; stack s1; cout << "Enter a postfix Expression : " << endl; cin >> postfix; cout << "Answer = " << s1.pop() << endl; return 0; } void evaluation(){ int i = 0,x , a,b,c; char input[100]; while(input[i] != '\0') { if(input[i] >= '0' && input[i] <= '9') { x = input[i] - 48; s1.push(x); } else if(input[i] == '+' || input[i] == '-' || input[i] == '*' || input[i] == '/') { a= s1.pop(); b= s1.pop(); switch (input[i]) { case '+': c = b+a; s1.push(c); break; case '-': c = b-a; s1.push(c); break; case '*': c = b*a; s1.push(c); break; case '/': c = b/a; s1.push(c); break; } } i++; } }
correct the mistakes of below code:
#include <iostream>
#define SIZE 50
using namespace std;
class stack{
int array[SIZE];
int top;
public :
stack(){
int top =-1;
}
bool isEmpty()
{
if (top == -1)
return true;
else
return false;
}
bool isFull()
{
if(top == SIZE)
return true;
else
return false;
}
void push(int value)
{
if(!isFull())
array [top++] = value;
else{
cout << "Stack is Full ";
}
}
int pop()
{
if(!isEmpty())
return array[top--];
else
{
cout << " Stack is Empty";
}
}
};
int main(){
int postfix;
stack s1;
cout << "Enter a postfix Expression : " << endl;
cin >> postfix;
cout << "Answer = " << s1.pop() << endl;
return 0;
}
void evaluation(){
int i = 0,x , a,b,c;
char input[100];
while(input[i] != '\0')
{
if(input[i] >= '0' && input[i] <= '9')
{
x = input[i] - 48;
s1.push(x);
}
else if(input[i] == '+' || input[i] == '-' || input[i] == '*' || input[i] == '/')
{
a= s1.pop();
b= s1.pop();
switch (input[i])
{
case '+':
c = b+a;
s1.push(c);
break;
case '-':
c = b-a;
s1.push(c);
break;
case '*':
c = b*a;
s1.push(c);
break;
case '/':
c = b/a;
s1.push(c);
break;
}
}
i++;
}
}
Step by step
Solved in 2 steps
