Hi, i am currently working on an expression evaluating calculator using a stack to evaluate expressions in reverse polish notation.

I am up to the point where i need to convert infix notation to reverse polish.

I know where to go next, in the respect of creating a binary tree and getting the info from that into reverse polish notation, i was just wondering if anyone had done this before, and could offer me any advice...I read in another thread that Guv had created a stack calculator before... Any ideas Guv?

I have seen a very good example in VB of the use of a binary tree to evaluate expressions, but i have lost the link to the site. It was posted in this forum on a thread about evaluating expressions some time ago. I would be greatful if someone could give me a link to this site, as i cannot find the link after searching the forum...

Any ideas, advice or info.?

Laterz