Create a program that allows the user to insert an arbitrary number of
integers into a binary search tree. When the inserts are complete, ask
the user to input an integer. Search the tree for this integer and
report how many comparisons it took to find the number or prove it was
not in the tree.

For extra credit, allow deletion in your tree.


--------
Sample Execution


Please input a positive integer (-1 to quit): 3
Please input a positive integer (-1 to quit): 4
Please input a positive integer (-1 to quit): 5
Please input a positive integer (-1 to quit): 6
Please input a positive integer (-1 to quit): 2
Please input a positive integer (-1 to quit): -1

The tree is:
3 2 4 -1 -1 -1 5 -1 -1 -1 -1 -1 -1 -1 6

Please input a positive integer for search (-1 to quit): 2
2 was found in the tree with 2 comparisons
Please input a positive integer for search (-1 to quit): 3
3 was found in the tree with 1 comparison
Please input a positive integer for search (-1 to quit): 4
4 was found in the tree with 2 comparisons
Please input a positive integer for search (-1 to quit): 5
5 was found in the tree with 3 comparisons
Please input a positive integer for search (-1 to quit): 6
6 was found in the tree with 4 comparisons
Please input a positive integer for search (-1 to quit): 7
7 was not found in the tree with 4 comparisons
Please input a positive integer for search (-1 to quit): 1
1 was not found in the tree with 2 comparisons
Please input a positive integer for search (-1 to quit): -1