Write a Java Program to traverse a binary tree using InOrder traversal with recursion. In InOrder traversal first left node is visited, followed by root and right node. The letters are placeholders. You must substitute with numbers that will satisfy a binary tree. You don't need to prompt for user input but you must put in numbers, in place of the letters, that will result in a valid binary search tree.

Input:

Output: A B CDEFGH I

Skeleton code: