实现二叉树对于我们已经算是轻车熟路了。先来定义树的结点：class AVLNode {
public int data;
public int depth;
public int balance;
public AVLNode parent;
public AVLNode left;
public AVLNode right;
public AVLNode(int data) {
this.dat
package 平衡树;
public class Tree {
public Node root;
//二叉树的：中序遍历
public void inOrder(Node temp){
if(temp!=null){
inOrder(temp.leftChild);
System.out.println("--中序--"+temp.data);
