This program performs basic operations on a binary search tree. It reads a sequence of instructions from the standard input stream and outputs the results to the standard output stream. The program accepts the following instructions: - `a value` and the `value` to the treemin remove and return the smallest value stored in the current treemax remove and return the largest value stored in the current treeprint print the values stored in the current tree in order of the inorder traversal; the values should be separated by a single space