-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathexp.c
More file actions
207 lines (185 loc) · 3.1 KB
/
exp.c
File metadata and controls
207 lines (185 loc) · 3.1 KB
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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
/*: Expression tree*/
#include<stdio.h>
#include<stdlib.h>
#define SIZE 50
typedef struct tnode
{
char data;
struct tnode *left,*right;
}TNODE;
typedef struct
{
TNODE *a[SIZE];
int top;
}stack;
void push(stack * ,TNODE * );
TNODE * pop(stack * );
TNODE * createtree(char pf[]);
void inorder(TNODE * );
void preorder(TNODE * );
int evaluate(TNODE * );
int calculate(char ,int ,int );
int main()
{
char postfix[50];
TNODE *root;
int ch,ele;
printf("\nEnter the expression in postfix format:");
scanf("%s",postfix);
root=createtree(postfix);
while(1)
{
printf("\nEnter \n1.For inorder traversal \n2.For preorder traversal \n3.For postorder traversal \n4.To evaluate \n5.Exit \n");
scanf("%d",&ch);
switch(ch)
{
case 1:
printf("\nTraversal in inorder format:");
inorder(root);
break;
case 2:
printf("\nTraversal in preorder format:");
preorder(root);
break;
case 3:
printf("\nTraversal in postorder format:");
printf("%s",postfix);
break;
case 4:
ele=evaluate(root);
printf("The result is:%d",ele);
break;
case 5:
exit(1);
}
}
return 0;
}
void push(stack *s,TNODE *p)
{
s->a[++(s->top)]=p;
}
TNODE * pop(stack *s)
{
return (s->a[s->top--]);
}
TNODE * createtree(char pf[])
{
stack s;
int i;
s.top=-1;
for(i=0;pf[i]!='\0';i++)
{
TNODE *p;
p=(TNODE *)malloc(sizeof(TNODE));
p->data=pf[i];
p->left=NULL;
p->right=NULL;
if(!isdigit(pf[i]))
{
p->right=pop(&s);
p->left=pop(&s);
}
push(&s,p);
}
return(pop(&s));
}
void inorder(TNODE *rt)
{
if(rt!=NULL)
{
if((rt->left!=NULL)&&(rt->right!=NULL))
{
printf("(");
}
inorder(rt->left);
printf("%c",rt->data);
inorder(rt->right);
if((rt->left!=NULL)&&(rt->right!=NULL))
{
printf(")");
}
}
}
void preorder(TNODE *rt)
{
if(rt!=NULL)
{
printf("%c",rt->data);
preorder(rt->left);
preorder(rt->right);
}
}
int evaluate(TNODE *rt)
{
int n1,n2,ele;
if((rt->left==NULL)&&(rt->right==NULL))
{
return (rt->data-'0');
}
n1=evaluate(rt->left);
n2=evaluate(rt->right);
ele=calculate(rt->data,n1,n2);
return ele;
}
int calculate(char opt,int op1,int op2)
{
int n;
switch(opt)
{
case '+':
n=(op1+op2);
break;
case '-':
n=(op1-op2);
break;
case '/':
n=(op1/op2);
break;
case '*':
n=(op1*op2);
break;
}
return n;
}
/*Output:
Enter the expression in postfix format:123*+
Enter
1.For inorder traversal
2.For preorder traversal
3.For postorder traversal
4.To evaluate
5.Exit
1
Traversal in inorder format:(1+(2*3))
Enter
1.For inorder traversal
2.For preorder traversal
3.For postorder traversal
4.To evaluate
5.Exit
2
Traversal in preorder format:+1*23
Enter
1.For inorder traversal
2.For preorder traversal
3.For postorder traversal
4.To evaluate
5.Exit
3
Traversal in postorder format:123*+
Enter
1.For inorder traversal
2.For preorder traversal
3.For postorder traversal
4.To evaluate
5.Exit
4
The result is:7
Enter
1.For inorder traversal
2.For preorder traversal
3.For postorder traversal
4.To evaluate
5.Exit
5*/