Printable View
hello everybody.
I want to concert postfix notation to binary tree.would u please help me?
is it possible?if yes would u please describe the algorith?
example Postfix notation: 3 not 2 or 1 and not
Formula: ¬ 1 ∧ (2 ∨ ¬3)
thank u in advance.
regards,
iman
> example Postfix notation: 3 not 2 or 1 and not
> Formula: ¬ 1 ∧ (2 ∨ ¬3)
Don't you mean
3 not 2 or 1 not and
Shunting-yard algorithm - Wikipedia, the free encyclopedia
It's probably not what you want, but the references at the end might lead you to something more appropriate.