Which traversal of a Binary Expression Tree would evaluate the expression in postfix (reverse Polish) notation?a)Postorderb)Preorderc)Level-orderd)Inorder

The traversal of a Binary Expression Tree that would evaluate the expression in postfix (reverse Polish) notation is a) Postorder.

Here's why:

1. In a Binary Expression Tree, each node corresponds to an operator or an operand. The root of the tree is the main operator, and the left and right subtrees are the operands.

2. Postfix notation, also known as Reverse Polish Notation (RPN), is a mathematical notation in which every operator follows all of its operands.

3. The postorder traversal of a binary tree visits the left subtree, then the right subtree, and finally the root. This is exactly the order required for postfix notation.

So, the correct answer is a) Postorder.