创建一棵二叉排序树，并以括号表示法输出，然后判断它是否为一棵二叉排序树；采用递归和非递归两种方法查找关键字，删除关键字-Create a binary sort tree, and brackets indicate that the output method, and then judge whether it is for a binary sort tree　the use of recursive and non-recursive two ways to find keywords to delete the keyword