tomorrow_shoe的博客

平衡二叉树不平衡时有四种形状LL,RR,LR,RL其中LR,RL均可以通过一次旋转(LL或者RR)转化成LL,RR,故旋转只用写两种public class AVLNode { int data, depth, balance; AVLNode parent, left, right; AVLNode(int data) { this.data = data; balance = 0; left = null;

package shu;public class myNode { Node root; public myNode(Node root) { super(); this.root = root; } public boolean isEmpty() { return root == null; } public void pre() { if (this.r...