编写递归算法：对于二叉树中每一个元素值为x的结点，删去以它为根的子树，并释放相应的空间。-Write a recursive algorithm: the value for each element in the binary tree node x, by deleting sub-tree root and release the appropriate space.