The travino function is a recursive function. First, it ensures the supplied node is not NULL. If the node is not NULL, a recursive call to the travino function is made with the node's left child. The node is checked to ensure it's not NULL. If it isn't, again, a recursive call to the travino function is made with its left child. If the node is NULL, the value in the data member of the node is displayed on the screen and a recursive call to the travino function is made with the node's right child. This procedure is repeated until all of the nodes that are displayed on the screen have been visited.
The inorder traversal is described as L,V,R, as follows:
- L means visiting the left child
- V means ...
