This project can only be written in C++ and must use LinkedLis cash

Search tree (BST), otherwise it will not be scored. Specialized must have the following menu functions

(A) Insert value into binary, enter the value from the case, the case

The extension file name must be .xt (separate the value with a "space key",

End with "Enter")

(B) Insert the value into the binary, enter the value from the keyboard (between the values

Separate with "Spacebar" and end with "Enter")

(C) Query whether a specific value exists in this binary tree

(D) What is the smallest value of the query?

(E) Delete a specific value from this binary tree, if the value does not exist, then

Postback does not exist

(F) List the values in this binary tree in the order of'InorderTraversal'

(G) End this program

Unless the user chooses (G) to exit the program,

After the task is set, a menu will be displayed for the user to select.