一、创建结点类
package com.milearn.structrue.AVLtree;
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 leftRotate() {
Node newNode = new Node(value);
newNode.left = left;
newNode.right = right.left;
value = right.value;
right = right.right;
left = newNode;
}
public void rightRotate() {
Node newNode = new Node(value);
newNode.right = right;
newNode.left = left.right;
value = left.value;
left = left.left;
right = newNode;
}
public int leftHeight() {
if (left == null) {
return 0;
}
return left.height();
}
public int rightHeight() {
if (right == null) {
return 0;
}
return right.height();
}
public int height() {
return Math.max(left == null ? 0 : left.height(),right == null ? 0 : right.height()) + 1;
}
public void add(Node node) {
if (node == null) {
return;
}
if (node.value < this.value) {
if (this.left == null) {
this.left = node;
} else {
this.left.add(node);
}
}else {
if (this.right == null) {
this.right = node;
}else {
this.right.add(node);
}
}
if (rightHeight() - leftHeight() > 1) {
if (right != null && right.leftHeight() > right.rightHeight()) {
right.rightRotate();
}
leftRotate();
return;
}
if (leftHeight() - rightHeight() > 1) {
if (left != null && left.rightHeight() > left.leftHeight()) {
left.leftRotate();
}
rightRotate();
}
}
public void indexOrder() {
if (this.left != null) {
this.left.indexOrder();
}
System.out.println(this);
if (this.right != null) {
this.right.indexOrder();
}
}
public Node search(int value) {
if (value == this.value) {
return this;
}else if(value < this.value) {
if (this.left == null) {
return null;
}
return this.left.search(value);
}else {
if (this.right == null) {
return null;
}
return this.right.search(value);
}
}
public Node searchParent(int value) {
if ((this.left != null && this.left.value == value) || (this.right != null && this.right.value == value)) {
return this;
}else if(value < this.value && this.left != null){
return this.left.searchParent(value);
}else if(value >= this.value && this.right != null) {
return this.right.searchParent(value);
}else {
return null;
}
}
}
二、创建二叉树
package com.milearn.structrue.AVLtree;
public class AVLTree {
private Node root;
public Node getRoot() {
return root;
}
public void addNode(Node node) {
if (root == null) {
root = node;
}else {
root.add(node);
}
}
public void indexOrder() {
if (root != null) {
root.indexOrder();
}else {
System.out.println("二叉树为空! ");
}
}
public Node search(int value) {
if (root == null) {
return null;
}else {
return root.search(value);
}
}
public Node searchParent(int value){
if (root == null) {
return null;
}else {
return root.searchParent(value);
}
}
public void delNode(int value) {
if (root == null) {
return;
}else {
Node targetNode = search(value);
if (targetNode == null) {
return;
}
if(root.left == null && root.right == null) {
root = null;
return;
}
Node parent = searchParent(value);
if (targetNode.left == null && targetNode.right == null) {
if (parent.left != null && parent.left.value == value) {
parent.left = null;
} else if(parent.right != null && parent.right.value == value) {
parent.right = null;
}
}else if (targetNode.left != null && targetNode.right != null) {
int minValue = delRightTreeMin(targetNode.right);
targetNode.value = minValue;
}else {
if (targetNode.left != null) {
if(parent != null) {
if (targetNode.left.value == value) {
parent.left = targetNode.left;
}else {
parent.right = targetNode.left;
}
}else {
root = targetNode.left;
}
}else {
if (parent != null) {
if (parent.left.value == value) {
parent.left = targetNode.right;
}else {
parent.right = targetNode.right;
}
}else {
root = targetNode.right;
}
}
}
}
}
public int delRightTreeMin(Node node) {
Node target = node;
while (target.left != null) {
target = target.left;
}
delNode(target.value);
return target.value;
}
}
三、测试
package com.milearn.structrue.AVLtree;
public class Main {
public static void main(String[] args) {
int arr[] = {10,11,7,6,8,9};
AVLTree avlTree = new AVLTree();
for (int i = 0; i < arr.length; i++) {
avlTree.addNode(new Node(arr[i]));
}
System.out.println("中序遍历");
avlTree.indexOrder();
System.out.println("树的高度=:" + avlTree.getRoot().height());
System.out.println("左子树的高度=:" + avlTree.getRoot().leftHeight());
System.out.println("右子树的高度=:" + avlTree.getRoot().rightHeight());
}
}