Build Binary Expression Tree From Infix Expression

Given an infix arithmetic expression string, construct a binary expression tree where internal nodes are operators and leaves are operands, ensuring the tree reflects operator precedence, associativity, and parentheses. The challenge is robustly parsing the input (multi-digit numbers, spaces, and unary operators) so the resulting tree evaluates to the correct order of operations.