Write a program that evaluates a compact arithmetic expression.

• Create expr_tree_eval.c.
• The program expects exactly one expression argument (argc must be 2).
• The expression contains only digits from 0 to 9, +, *, (, and ).
• There are no spaces to handle.
• * has higher precedence than +.
• Parentheses override precedence.
• Print the computed integer followed by a newline for a valid expression.
• For a malformed expression, print Invalid token '<char>' followed by a newline and return 1.
• If the malformed expression ends where another token was required, print Unexpected end followed by a newline and return 1.
• Return 1 when the argument count is wrong.

Write a program that evaluates a compact arithmetic expression.

• Create expr_tree_eval.c.
• The program expects exactly one expression argument (argc must be 2).
• The expression contains only digits from 0 to 9, +, *, (, and ).
• There are no spaces to handle.
• * has higher precedence than +.
• Parentheses override precedence.
• Print the computed integer followed by a newline for a valid expression.
• For a malformed expression, print Invalid token '<char>' followed by a newline and return 1.
• If the malformed expression ends where another token was required, print Unexpected end followed by a newline and return 1.
• Return 1 when the argument count is wrong.