构造一颗二叉排序树并实现其中元素的插入和删除。即先输入一串数据（int型），使计算机构造出一棵二叉排序树（限于C语言的表达，咱不在屏幕上使其输出）。然后按照屏幕提示，删除一个已有的数据，再构成一个新的二叉排序树。-Construct a binary sort tree and which elements insertions and deletions.To enter a string of data (int type), the computer constructed a binary sort tree (limited to the expression of the C language, we are not on the screen so that the output).Then follow the onscreen prompts to delete an existing data to form a new binary sort tree.