题目4． 二叉排序树的建立、插入、删除和查找

给出一组关键值，建立相应的二叉排序树，完成：

⑴结点的删除操作。要求可以实现删除根结点、叶子结点以及其它任意结点的功能；

⑵插入一个新结点的操作；

⑶对给定的值在二叉排序树进行查找；

⑷随时显示操作的结果。

-Title 4. Binary Sort Tree Establishment, insert, delete, and search are given a set of key values, the establishment of the corresponding binary sort tree to complete: ⑴ node deletion. Requirements can delete root node, leaf nodes, as well as other arbitrary node function　⑵ insert a new node operation　⑶ value given in the binary sort tree to find　⑷ at any time show the results of operations.