java 平衡二叉树实现

////////////////////////////////////////////////节点类 TreeNode.java    //////////////////////////
package com.tree;
    class TreeNode {//包访问权限
    long data ;
    long x,y;
    String adrr;
    TreeNode left;
    TreeNode right;
    int size=0;
  
   public TreeNode(){};
   public TreeNode(long data,long x,long y,String addr){
    size++;
    this.data=data;
    this.x=x;
    this.y=y;
    this.adrr=addr;
    
    }
   public TreeNode(long data ,TreeNode left ,TreeNode right){
    size++;
    this.data=data;
    this.left=left;
    this.right=right;
   }
public long getData() {
 return data;
}
public void setData(long data) {
 this.data = data;
}
public long getX() {
 return x;
}
public void setX(long x) {
 this.x = x;
}
public long getY() {
 return y;
}
public void setY(long y) {
 this.y = y;
}
public TreeNode getLeft() {
 return left;
}
public void setLeft(TreeNode left) {
 this.left = left;
}
public TreeNode getRight() {
 return right;
}
public void setRight(TreeNode right) {
 this.right = right;
}
public int getSize() {
 return size;
}
public void setSize(int size) {
 this.size = size;
}
public String getAdrr() {
 return adrr;
}
public void setAdrr(String adrr) {
 this.adrr = adrr;
}
}
/////////////////////////////////////////  tree.java  /////////////////////////////
       package com.tree;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.util.Random;
import com.vdoany.db.DbHandle;
public class Tree {
 private