How to understand a recursive inorder traversal of a BST in Java?

Question

I am trying to understand how the well-established methods of implementing an inorder traversal of a binary search tree is functioning in Java.

I am given the followi