if you mean expression tree then it will be like this :-
In-order traversal of an expression tree gives infix notation which is mentioned in the question.
is $b\left [ i \right ]$ and $c\left [ j \right ]$ is in terminal form?
Then how r u making syntax tree for it?
$b\left [ i \right ]+$ cannot be parse to a grammar, because it is not a handle
not a handle
So, parse tree is not possible with it