postfix to infex

[ararsil]

please convert into postfix expression
3↑ 2 + 5 * 4 ↑ 3 – 18 / 9

Symbol Postfix Stack

and evaluate outcome postfix

Input operand 1 operand 2 value stack

please show each steps

[writetonsharma]

did you try something?? pls post it.

[ararsil]

YES MR WRITE
SO FAR I DID THIS

Symbol Postfix Stack
3 3
↑ ↑
2 32 ↑
+ 32 +
↑
5 32↑5 ↑
+
* 32↑5 *
+
4 32↑5*4 +
↑ 32↑5*4 ↑
+
3 32↑5*4↑3 +
- 32↑5*4↑3 -
+
18 32↑5*4↑3+18 -
/
9 32↑5*4↑3+189/-





b) Evaluate the postfix expression of part (a) using stack.

Write each step of this evaluation using the following table.

Input operand 1 operand 2 value stack
3 3
2 2
3
↑ 3 2 9 9
5 5
9
* 9 5 45 45
4 4
45
↑ 45 4 2025 2025
3 3
2025
+ 2025 3 2028 2028
1 1
2028
8 8
1
2028
9 9
8
1
2028
/ 8 9 0.8
1
2028
- 1 0.8 0.2
2028

[writetonsharma]

ooopss..

you want the working only?? or are you trying to develop this in C++?

[ararsil]

yes sharma this is on paper work only dear

please do it fast i need to sumbit my assignment today

[writetonsharma]

what is this charactrer: ↑
I am taking it as exponent.

3↑ 2 + 5 * 4 ↑ 3 – 18 / 9
32↑
32↑543↑*
32↑543↑*+
3 2 ↑ 5 4 3 ↑ * + 18 9 / -

verify this. I may be wrong.

[ararsil]

so far thanks

where you form ?

[writetonsharma]

its ok...

Im from India.. :) wat about u?

[ararsil]

i am from spain please help me in binary tree diagram

Inorder Traversal
Postorder Traversal
please give me the e mail id to post you diagram

[writetonsharma]

I suggest you try it once... binary tree traversal are quite easy.
[e-mail]