二叉排序树采用二叉链表存储。写一个算法，删除结点值是X的结点。要求删除该结点后,此树仍然是一棵二叉排序树，并且高度没有增长（注：可不考虑被删除的结点是根的情况）。-Binary sort tree stores using the binary tree. Write an algorithm deleting node value of X node. Requested the deletion of the node, this tree is still a binary sort tree, and the height is not growing (Note: time to consider the deleted node is the root of the situation).