Привет отново колеги :)

мъча се тука с Infix to Postfix, но честно казано не съм и много наясно какво точно трябва да правя :D

с този код минавам 1 и 2 тест, останалите 3 са грешни.

https://pastebin.com/Z0L4TNKF

опитвам се да го направя с тези обяснения и по-точно псевдокода 

https://en.wikipedia.org/wiki/Shunting-yard_algorithm

while there are tokens to be read:
    read a token.
    if the token is a number, then:
        push it to the output queue.
    if the token is a function then:
        push it onto the operator stack
    if the token is an operator, then:
        while ((there is a function at the top of the operator stack)
               or (there is an operator at the top of the operator stack with greater precedence)
               or (the operator at the top of the operator stack has equal precedence and is left associative))
              and (the operator at the top of the operator stack is not a left bracket):
            pop operators from the operator stack onto the output queue.
        push it onto the operator stack.
    if the token is a left bracket (i.e. "("), then:
        push it onto the operator stack.
    if the token is a right bracket (i.e. ")"), then:
        while the operator at the top of the operator stack is not a left bracket:
            pop the operator from the operator stack onto the output queue.
        pop the left bracket from the stack.
        /* if the stack runs out without finding a left bracket, then there are mismatched parentheses. */
if there are no more tokens to read:
    while there are still operator tokens on the stack:
        /* if the operator token on the top of the stack is a bracket, then there are mismatched parentheses. */
        pop the operator from the operator stack onto the output queue.
exit.

ако някой знае къде бъркам да каже сега или да замълчи завинаги :D

П.С. предполагам че може да е от проверката на операторите hasGreaterPrecedenceOrEqualAndLeft, но....