In the inorder print function, first we call recursion on left, then print and then call recursion on right.
So how do we print values of root and right side values when there is no print statement?
Inorder print function
When we call recursion on left part that means it will print for left part
Then the print statement print the data of current node
And them recursion call on right part prints the node in right part of tree
Do a dry run and u will understand