一、概念
二叉搜索树又称二叉排序树,它或者是一棵空树,或者是具有以下性质的二叉树:
- 若它的左子树不为空,则左子树上所有节点的值都小于根节点的值
- 若它的右子树不为空,则右子树上所有节点的值都大于根节点的值
- 它的左右子树也分别为二叉搜索树
{5,3,4,1,7,8,2,6,0,9};
二、二叉搜索树的操作
1、查找
public TreeNode serach(int val){
TreeNode cur = root;
while(cur != null){
if(cur.val > val){
cur = cur.left;
} else if (cur.val < val) {
cur = cur.right;
}
else{
return cur;
}
}
return null;
}
2、插入
- 如果树为空树,即根 == null,直接插入
- 如果树不是空树,按照查找逻辑确定插入位置,插入新结点
public boolean insert(int key){
if(root == null){
TreeNode root = new TreeNode(key);
return true;
}
TreeNode parent = null;
TreeNode cur = root;
while(cur != null){
if(cur.val > key){
parent = cur;
cur = cur.left;
} else if (cur.val < key) {
parent = cur;
cur = cur.right;
}
else{
return false;
}
}
TreeNode node = new TreeNode(key);
if(parent.val < key){
parent.right = node;
}
else{
parent.left = node;
}
return true;
}
3、删除(难点)
设待删除结点为 cur, 待删除结点的双亲结点为 parent
- cur.left == null
- 1.cur 是 root,则 root = cur.right
- 2.cur 不是 root,cur 是 parent.left,则 parent.left = cur.right
- 3.cur 不是 root,cur 是 parent.right,则 parent.right = cur.right
- cur.right == null
- 1.cur 是 root,则 root = cur.left
- 2.cur 不是 root,cur 是 parent.left,则 parent.left = cur.left
- 3.cur 不是 root,cur 是 parent.right,则 parent.right = cur.left
- cur.left != null && cur.right != null
- 1.需要使用替换法进行删除,即在它的右子树中寻找中序下的第一个结点(关键码最小),用它的值填补到被
删除节点中,再来处理该结点的删除问题
public void removeNode(TreeNode parent,TreeNode cur){
if(cur.left == null){
//cur左边为空分为三种情况
if(cur == root){
root = cur.right;
}
if(cur == parent.left){
parent.left = cur.right;
}
if(cur == parent.right){
parent.right = cur.right;
}
}
//右边为空的三种情况
else if (cur.right == null) {
if(cur == root){
root = cur.left;
}
if(cur == parent.left){
parent.left = cur.left;
}
if(cur == parent.right){
parent.right = cur.left;
}
}
//cur的左右都不为空的情况
else{
TreeNode target = cur.right;
TreeNode targetParent = cur;
while(target.left != null){
targetParent = target;
target = target.left;
}
//交换
cur.val = target.val;
if(target == targetParent.left) {
targetParent.left = target.right;
}
else {
targetParent.right = target.right;
}
}
}