Write a C++ program to implement a Binary Search Tree (BST). Load the values from input file to populate your BST. Search values to see your BST contains it and print the result.

1. Implement a BST using your own code. 2. Load the values from input file to the BST (integers) 3. Find and print Minimum value and Maximum value from your BST. 4. Program ask for an integer input to search. 5. Search tree recursively to find a match. 6. Print the result of your search. 7. Input of -1 (negative 1) should exit the program.