平衡二叉树：插入结点

在平衡二叉排序树BBST上插入一个新数据元素e

删除结点

删除结点过程与插入结点的操作类似，基本过程是：平衡二叉树，找到要删除的结点，删除一个结点，变成二叉树，旋转，变回平衡二叉树。

查找

把给定值与根结点作比较,若给定值大于根结点则查找其右子树,小于则查找其左子树,如此类推。

-Insertion node in the balanced binary sort tree BBST insert a new data element e removed nodes removed node insertion process and the operation of similar nodes, the basic process is: a balanced binary tree, find the node you want to delete, delete a nodes, into a binary tree, rotation, turned back into a balanced binary tree. Find the given value to compare with the root node, if the value is greater than a given root node to find its right subtree is less than the search for its left subtree, and so on.