How can I convert a boolean query from post-fix to infix notation like these

Question

Editorial Team

Asked: May 27, 20262026-05-27T06:26:55+00:00 2026-05-27T06:26:55+00:00

How can I convert a boolean query from post-fix to infix notation like these two examples:

Example 1:

infix : Tony and George
post-fix : Tony George and

Example 2:

infix : Tony and George or Lona
post-fix : Tony George and Lona or

You must login to add an answer.

Need An Account,

Editorial Team · Answer 1 · 2026-05-27T06:26:55+00:00

i am not writing the exact code which you want but i am giving you an idea about it.

you can simply use infix to postfix algorithm which we normally use of mathematical expressions.

you can find one alog here

and in that algo you can replace operators with your desired Boolean operators(and ,or you can use them like a string also)

some days before i developed a code for infix to postfix in c++ so for reference you can take a look of that

The Archive Base Latest Questions