Submit a program that implements a BST(Binary Search Tree). Specifically, write functions that:

Insert a node given an integer into the tree.

Delete the node in the tree given an integer. If the node does not exist in the tree, then let the user know.

Print the values in the tree in ascending order.

Print the tree using parenthetical notation.

Given an integer, return the node pointer for the node that has that integer as an attribute.

Display just the smallest value in the BST.

Display just the largest value in the BST.

If you decide to provide your own main function, then it should present a menu allowing me to execute any one of the five functions above. The menu should loop until I choose the option to quit the program.

Include all the files needed if you choose to use header files.

c++, Please post only working code, and output if possible.