二叉排序树(BST)
二叉排序树:对于二叉排序树的任意一个非叶子节点,它的左子节点的值比当前节点的值小,右子节点比当前节点的
值大(如果相同,放在左右均可,应尽量避免出现相同的值)
代码实现
** 二叉排序树节点类
public class Node {
int value;
Node left;
Node right;
public Node(int value) {
this.value = value;
}
@Override
public String toString() {
return "Node{" +
"value=" + value +
'}';
}
public void addNode(Node node) {
if (node == null) {
return;
}
if (node.value < this.value) {
if (this.left != null) {
this.left.addNode(node);
} else {
this.left = node;
}
}else {
if(this.right!=null){
this.right.addNode(node);
}else {
this.right=node;
}
}
}
public void mid(){
if(this.left!=null){
this.left.mid();
}
System.out.println(this);
if(this.right!=null){
this.right.mid();
}
}
public Node findNode(int value) {
if (this.value == value) {
return this;
} else if (value < this.value && this.left != null) {
return this.left.findNode(value);
} else if (value > this.value && this.right != null) {
return this.right.findNode(value);
} else {
return null;
}
}
public Node findParentNode(int value) {
if ((this.right != null && this.right.value == value) || (this.left != null && this.left.value == value)) {
return this;
} else if (this.left != null && this.value > value) {
return this.left.findParentNode(value);
} else if (this.right != null && this.value < value) {
return this.right.findParentNode(value);
} else {
return null;
}
}
}
** 二叉排序树类
public class BinarySortTree {
Node root;
public void addNode(Node node){
if(root==null){
root=node;
}else {
root.addNode(node);
}
}
public void midOrder(){
if(root==null){
System.out.println("二叉树为空");
}else {
root.mid();
}
}
public Node findNode(int value){
if(root==null){
return null;
}else {
return root.findNode(value);
}
}
public Node findParentNode(int value){
if(root==null){
return null;
}else {
return root.findParentNode(value);
}
}
public Node delRightNode(Node node) {
if (node.left != null) {
return delRightNode(node.left);
} else {
del(node.value);
return node;
}
}
@SuppressWarnings("all")
public void del(int value) {
Node node = findNode(value);
Node parentNode = findParentNode(value);
if (node == null) {
return;
}
if (node.right == null && node.left == null) {
if (parentNode == null) {
root = null;
} else {
if (parentNode.left == node) {
parentNode.left = null;
} else {
parentNode.right = null;
}
}
} else if (node.right != null && node.left != null) {
Node rightNode = delRightNode(node.right);
node.value=rightNode.value;
} else {
if (parentNode == null) {
if (node.left != null) {
root = node.left;
} else {
root = node.right;
}
} else {
if (parentNode.left == node) {
if (node.left != null) {
parentNode.left = node.left;
}
if (node.right != null) {
parentNode.left = node.right;
}
}
if (parentNode.right == node) {
if (node.left != null) {
parentNode.right = node.left;
}
if (node.right != null) {
parentNode.right = node.right;
}
}
}
}
}
}
** 测试类
public class BinarySortTreeTest {
public static void main(String[] args) {
int[] arr = {7, 3, 10, 12, 5, 1, 9,2};
BinarySortTree binarySortTree = new BinarySortTree();
for (int value : arr) {
binarySortTree.addNode(new Node(value));
}
binarySortTree.midOrder();
System.out.println("--------------");
binarySortTree.del(2);
binarySortTree.midOrder();
}
}