Trying to convert the following postfix expression into an infix expression...

A B + C D x E F / - - A x

Note, this is for a binary tree.

Having a lot of trouble interpreting this question. Firstly, I'm trying to draw this binary tree. The top root will be "x" (far-right operator in this postfix expression); however, I'm not sure how to group the left child and right child from here.