二叉搜索树类的c++实现，实现建立树，插入，删除，查找等操作。它或者是一棵空树，或者是具有下列性质的二叉树： 若它的左子树不空，则左子树上所有结点的值均小于它的根结点的值； 若它的右子树不空，则右子树上所有结点的值均大于它的根结点的值； 它的左、右子树也分别为二叉排序树。-Binary search tree c++ implementation, to achieve the establishment of tree, insert, delete, search and other operations. It or a hollow tree, or is a binary tree with the following properties: if its left sub tree is not empty, left sub tree all nodes of the values are less than the value of the root node　if its right subtree is not empty, the right subtree of all node values were greater than the value of the root node　the left and the right subtree separately for binary sort tree.