//二叉搜索树
class Node{
public int val;
public Node left;
public Node right;
public Node(int val){
this.val=val;
}
}
public class BinarySearchTree {
public Node root=null;//根节点
//寻找节点
public Node search(int key){
Node cur=root;
while(cur!=null){
if(cur.val<key){
cur=cur.right;
}else if(cur.val==key){
return cur;
}else{
cur=cur.left;
}
}
return null;
}
//插入节点(需要记录父亲节点)
public boolean insert(int val){
if(root==null){
root=new Node(val);
return true;
}
Node cur=root;
Node parent=null;
while(cur!=null){
if(cur.val<val){
parent=cur;
cur=cur.right;
}else if(cur.val==val){
return false;
}else{
parent=cur;
cur=cur.left;
}
}
Node node=new Node(val);
if(parent.val<val){
parent.right=node;
}else{
parent.left=node;
}
return true;
}
//删除节点cur(删除需要知道它的父亲节点parent)
public void remove(int key){
Node cur=root;
Node parent=null;
while (cur != null) {
if(cur.val==key){//此时找到了需要删除的节点
removeNode(cur,parent);//进行删除。删除需要知道要删除的节点cur,和cur的父亲节点parent
break;
}else if(cur.val<key){
parent=cur;
cur=cur.right;
}else{
parent=cur;
cur=cur.left;
}
}
}
public void removeNode(Node cur,Node parent){
if(cur.left==null){
if(cur==root){
root=cur.right;
}else if(cur==parent.left){
parent.left=cur.right;
}else{
parent.right=cur.right;
}
}else if(cur.right==null){
if(cur==root){
root=cur.left;
}else if(cur==parent.left){
parent.left=cur.left;
}else{
parent.right=cur.left;
}
}else{//此时cur.left!=null&&cur.right!=null
//思路:找cur左树的最大值target,或者找出cur右树的最小值target,(我采用找出cur右树的最小值target)
// 将target的值放入cur中,再将target删除,因为要删除target,需要知道target的父亲节点targetParent
Node targetParent=cur;
Node target=cur.right;
while(target.left!=null){//在搜索树的左边找最小值,左边的叶子节点最小,因为搜索树的左边比右边小
targetParent=target;
target=target.left;
} //此时target肯定没有左树了
//此时找到了cur左树的最小值target,
cur.val=target.val;
if(target==targetParent.left){//此时target为要删除的元素
targetParent.left=target.right;
}else{
targetParent.right=target.right;
}
}
}
}
二叉搜索树的增删查操作~
于 2022-03-02 18:17:48 首次发布