CUET PG 2026 — Computer PYQ

Solution

In Computer Science, a specific type of binary tree is used to represent mathematical expressions.

• Definition: An Expression Tree is a binary tree in which the internal nodes correspond to operators (like $+$, $-$, $\ast$, $/$) and the leaf nodes correspond to operands (like constants or variables).

• Properties: * The structure of the tree naturally reflects the order of operations (precedence).

  • An In-order traversal of this tree produces the $Infix$ expression.

  • A Post-order traversal produces the $Postfix$ (Reverse Polish Notation) expression.

  • A Pre-order traversal produces the $Prefix$ (Polish Notation) expression.

Conclusion

The correct term for a tree representing an arithmetic expression is an expression tree.

The correct option is (d).