Hi All,

Is it possible to have an infix expression in a ternary tree?
I am asking this because in a binary tree the infix expression is defined as visiting the left of the root, then the root, after that the right of the root. But in a ternary tree since there are 3 child nodes for each root, when should the root node be visited in order to make it infix.

I dont know any practical use of such a tree but it is a question that was once asked in an interview. any information regarding this will be great.