Applications of Stack

[@ruqayamir9100]

Explained beautifully

[@Themathjester]

Mic 😢

[@aijazmir6034]

Are you a teacher in gdc pattan

[@rightclick80]

// Header file save it as infpos.h file #include #include #define MAX 100 char stack[MAX],postf[MAX]; int top = -1; void push(char x) { stack[++top] = x; } char pop() { if(top == -1) return -1; else return stack[top--]; } int priority(char x) { if(x == '(') return 0; if(x == '+' || x == '-') return 1; if(x == '*' || x == '/') return 2; if(x == '^' || x == '$') return 3; return 0; } void inf2post(char exp[MAX]) { int i=0,j=0; char x; while(exp[i] != '\0') { if(isalnum(exp[i])) //Operand postf[j++]=exp[i]; else if(exp[i] == '(') push(exp[i]); else if(exp[i] == ')') { while((x = pop()) != '(') postf[j++]=x; } else { while(priority(stack[top]) >= priority(exp[i])) postf[j++]=pop(); push(exp[i]); } i++; } while(top!= -1) { postf[j++]=pop(); } } //Program to Convert infix expression to prefix expression #include #include #include"infpos.h" #define Max 100 char inf[Max]; int main() { int i=0; //clrscr(); printf(" Enter non-numerical expression = "); scanf("%s",inf); strrev(inf); //Reverse the infix expression while(inf[i]!='\0') { if(inf[i]=='(') //change ( to ) and vice versa the infix expression inf[i]=')'; else if (inf[i]==')') inf[i]='('; i++; } inf2post(inf); // Convert the expression to postfix expression printf(" Prefix = %s",strrev(postf)); // Reverse the converted expression return 0; } //Program to Convert infix expression to postfix expression #include #include #define MAX 100 #include"infpos.h" int main() { char exp[100]; char x; int i=0; printf("Enter infix expression "); scanf("%s",&exp); printf(" "); inf2post(exp); printf("%s",postf); return 0; }