Hopefully the sample of input below is pretty self explanatory:

java calc.Calculator prefix + x 8 8 x 6 6
Infix = 8 x 8 + 6 x 6
Postfix = 8 8 x 6 6 x +
Result = 100

java calc.Calculator infix 2 – ( 6 + 9 ) / 3
Prefix = - 2 / + 6 9 3
Postfix = 2 6 9 + 3 / -
Result = -3

java calc.Calculator postfix 4 9 + 6 5 – x
Prefix = x + 4 9 – 6 5
Infix = (4 + 9) x (6 – 5)
13

Basically I need to create the output below the first line of each sample input. Of course, I'm planning to use Binary Tree to do this... I actually figured out an interesting stuff out of this sample output... Although, I haven't actually found the algorithm to solve the insert() method for the BinaryTree implementation. Anyways, I found out that the root is at the first index for the Prefix, Index/2 for the Infix, and Array.Length-1 for the postfix... I'm just wondering if anybody can suggest me implementation ideas...

__________________

---

i will love to see those code too =/

__________________

---

O_o I thought you've seen it already..?

__________________

---

where ?
the other post ?

isnt that only convert infix to postfix ?

__________________

---

I'd say that prefix and postfix are the easiest, to give a little clue on this, you may want to check and play around with Queue and Stacks

__________________

---