Recursive Traversal Method: Print

The goal for this exercise is to implement an interesting variation on the binary search tree’s Print method, in C# source code, using recursion.

 

Note that in order to pass the NUnit tests, each value (each integer) should be printed out on its own line, with nothing else (not even blank spaces) on that line.  The values should be printed out in order, so that the smallest value is printed first and the largest value is printed last.

 What you need to do for this exercise: 

1. In the provided starter solution, in the Student_Answers.cs file, there is a class named BinarySearchTree.  For this exercise, you should implement the ‘Print’ method using recursion.
   
   This method MUST be implemented using Recursion.  You will get no points for a solution that does not use a recursive approach to solve this problem.