Could we use the infix way to print in an ascending way the nodes in a binary tree search? When I say infix I mean this type of algorithm :
Infixe : If x
