Question

Suppose we are given the following expression: (x + xy) + (x/y). Represent this expression as a binary tree.

Answer 1

Not sure what to do for this problem.

Answer 2

I cant figure this problem out at all.

Answer 3

Is this supposed to be basically 'parsing' it? Well take it piece by piece, following order of operations. First, let's go left-to-right, considering the first expression bounded in parentheses, \(x+xy\). First, we'd have to multiply \(x\) and \(y\), and then we *add* this result with \(x\), yielding a expression tree that looks like: