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:

• add value add the value to the tree
• min remove and return the smallest value stored in the current tree (should have no effect if the current tree is empty)
• max remove and return the largest value stored in the current tree (should have no effect if the current tree is empty)
• print print the values stored in the current tree in order of the inorder traversal; the values should be separated by a single space

The main function in problem2.c reads and parses the input stream and calls appropriate functions to perform the instructions. Your task is to implement those functions so that the output produced by the program is correct.

I need to organize it alphabetically, coding in C with pre-written code. The Node code is as follows:

typedef struct bst_node { char * data; struct bst_node * right; struct bst_node * left; } bst_node ;

Thanks!