When we decompose any expression into

$($left expression$)$operation$($right expression$)$

the expression tree of that expression is the binary tree whose

Question $1$ options:

root contains the operation and whose left and right subtrees are the trees of the right and left expresssions, respectively

root contains the operation and whose left and right subtrees are the trees of the left and right expresssions, respectively

root contains the left expression and whose left and right subtrees are the trees of the operation and right expresssion, respectively

root contains the right expression and whose left and right subtrees are the trees of the left expresssion and operation, respectively