Here are the steps for finding the maximum value:

1. Start with the root node and set it as the current node.
2. If the current node is empty, return false.
3. Go to the right and set the right as the current node.
4. If the current node does not have a right node, go to step 5; otherwise, continue to step 4.
5. Continue to step 3 until all the right nodes are visited.
6. Return the current node.