Given the following expression tree, identify the correct arithmetic expression:

Concept: In an expression tree, every leaf is an operand and every internal node is an operator whose two children are its operands. The fully parenthesized infix expression is built by recursively wrapping each internal node's left-subtree-expression and right-subtree-expression around its own operator symbol, so the resulting parenthesization is never ambiguous.

1. The root node is division ( / ), so the final expression has the form (left-subtree expression) / (right-subtree expression).

2. The left subtree's root is addition ( + ) with children A and a multiplication node; that multiplication node's children are B and C — so the left subtree reads A + (B * C).

3. The right subtree is a subtraction ( − ) with children A and C — so the right subtree reads (A − C).

4. Substituting both subtrees into the root gives (A + (B * C)) / (A − C).

Cross-check: Re-parsing (A + (B * C)) / (A − C) under standard precedence confirms division is the outermost operator, the left grouping matches the left subtree, and the right grouping matches the right subtree. Note that dropping the outer parentheses — writing A + (B * C) / (A − C) — would instead parse as A + ((B * C) / (A − C)) under standard precedence, a different expression; the parentheses around the whole numerator are what make the addition happen before the division, exactly as the tree requires.

Hence the correct fully parenthesized expression is (A + (B * C)) / (A − C).