DSA/postfix.cpp at main · anshupanthi01/DSA · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
<<<<<<< HEAD
#define MAX 15
#include <iostream>
#include <string.h>
using namespace std;
int top = -1;
char postfix[50];
int stack[MAX];

int pop()
{
    int data = stack[top];
    top = top - 1;
    return data;
}

int push(int x)
{
    top = top + 1;
    stack[top] = x;
}

int main()
{
    int i, b, a;
    char ch;
    int var;
    cout << "Enter the postfix expression: ";
    cin >> postfix;
    int l = strlen(postfix);
    for (i = 0; i < l; i++)
    {
        cout << postfix[i] << "\n";
        if (postfix[i] == '*' || postfix[i] == '/' || postfix[i] == '+' || postfix[i] == '-')
        {
            a = pop();
            b = pop();
            switch (postfix[i])
            {
            case '*':
                var = b * a;
                break;
            case '/':
                var = b / a;
                break;
            case '+':
                var = b + a;
                break;
            case '-':
                var = b - a;
                break;
            default:
                cout << "Invalid";
                break;
            }
            push(var);
        }
        else
        {
            push(postfix[i] - 48);
        }
    }
    cout << stack[top];
    return 0;
}
=======
#define MAX 15
#include <iostream>
#include <string.h>
using namespace std;
int top = -1;
char postfix[50];
int stack[MAX];

int pop()
{
    int data = stack[top];
    top = top - 1;
    return data;
}

int push(int x)
{
    top = top + 1;
    stack[top] = x;
}

int main()
{
    int i, b, a;
    char ch;
    int var;
    cout << "Enter the postfix expression: ";
    cin >> postfix;
    int l = strlen(postfix);
    for (i = 0; i < l; i++)
    {
        cout << postfix[i];
        if (postfix[i] == '*' || postfix[i] == '/' || postfix[i] == '+' || postfix[i] == '-')
        {
            a = pop();
            b = pop();
            switch (postfix[i])
            {
            case '*':
                var = b * a;
                break;
            case '/':
                var = b / a;
                break;
            case '+':
                var = b + a;
                break;
            case '-':
                var = b - a;
                break;
            default:
                cout << "Invalid";
                break;
            }
            push(var);
        }
        else
        {
            push(postfix[i] - 48);
        }
    }
    cout <<"\n"<< stack[top];
    return 0;
}
>>>>>>> 317e81e (doubly_linear)