AVL树的性质以及定义(JAVA实现)

1.AVL树是一颗二叉搜索树，具有二叉搜索树的性质
2.对任意结点X,其左子树的高度与其右子树的高度的差不超过一

AVL树的定义

public class AVLTreeNode{
  private int data;
  private int height;
  private AVLTreeNode left;
  private AVLTreeNode right;

  public int getData(){
    return this.data;
  }
 
  public void setData(int data){
    this.data = data;
  }

  public int getHeight(){
    return this.height;
  }

  public void setHeight(int height){
    this.height = height;
  }

  public AVLTreeNode getLeft(){
    return left;
  }

  public void setLeft(AVLTreeNode left){
    this.left = left;
  }

  public AVLTreeNode getRight(){
    return this.right;
  }

  publci void setRight(AVLTreeNode right){
    this.right = right;
  }

}