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