说明：  写一个时间复杂度为O(log2n+m)的算法，删除二叉排序树践关键字不小于X的结点，并释放结点空间，其中n为二叉排序树中所含结点，m为被删除的结点个数
(Write a time complexity is O (log2n+ m) algorithm, delete the binary sort tree practice key node of not less than X, and release the node space, where n is contained in the binary sort tree nodes, and m the number of nodes to be deleted)