1. Recall that in a binary search tree, at every node, all elements to the left of the node have a smaller key, and all elements to the right of a node have a larger key. Write a program called that takes two parameters: a pointer to a binary search tree node, and an int parameter called min which will print all the elements bigger than the specified value, min. Your program should allow the user to enter data (integer) from standard input and construct a binary search tree. Make your program as ecient as possible and explain its worst-case asymptotic running time.

    void PrintElements(BinarySearchTree *node, int min) Input: A binary search tree node, representing the root of a BST Output: Does not return anything, but prints all node values that are bigger than min