Create a program the inputs any n number of integer values from the user into a singly Linked List. Once the user has finished inputting the values the program should create a binary search tree. Then the following options should be displayed to the user: Add New Node to tree Delete Node from tree should input a value from the user and search for that value in the BST. If the value is found it should be deleted otherwise an error message should be displayed Print Tree should print the tree on the console Delete Min should delete the smallest value in the tree Delete Max should delete the largest value in tree

c++