我在旋轉(zhuǎn)樹和返回旋轉(zhuǎn)的樹時遇到問題。幾乎在將新樹插入到我的 AVL 后，我檢查平衡是否小于 -1 并且父高度小于 0，這是正確的情況，我需要實現(xiàn)向左旋轉(zhuǎn)。我需要幫助理解為什么我的左旋轉(zhuǎn)不起作用以及如果它起作用為什么我沒有得到旋轉(zhuǎn)的樹的回報。public class AVLTree < T extends Comparable < T >> extends BinaryTree < T> {private int balance ;private AVLTree < T> parent;public AVLTree(T item){  this(item,null);}public AVLTree(T item, AVLTree<T> parent){  super(item);  this.balance = 0;  this.parent = parent;    }public AVLTree<T> insert(T item){  updateHeight(this);     if(this.item.compareTo(item) < 0){ if(this.left != null){             this.left.insert(item); }  else{    this.left= new AVLTree<T>(item, this);  }  return rotations((AVLTree<T>)this.left);  }  else{ if(this.right != null){        this.right.insert(item); } else{    this.right = new AVLTree<T>(item, this);         } return rotations((AVLTree<T>)this.right);  } }  private AVLTree<T> rotateLeft(AVLTree<T> x){AVLTree<T> temp = (AVLTree<T>)x.parent;AVLTree<T> an = (AVLTree<T>)temp.left;          //rotationtemp.left = x;temp.right = x.parent.right;x.right = an;//update heightsupdateHeight(x);updateHeight(temp);//return new rootreturn temp;}public AVLTree<T> rotations(AVLTree<T> input){  int balance = getBalance(input);//Right Rightif (balance < -1 && ph() < 0){   return input =rotateLeft(input);}return input;}public void updateHeight(AVLTree<T> current){  current.height = Math.max(height((AVLTree<T>)current.left), height((AVLTree<T>)current.right)) + 1;}public int getBalance(){  return getBalance(this);}public int getBalance(AVLTree<T> current){  return (current == null)? 0 : height((AVLTree<T>)current.right) -    height((AVLTree<T>)current.left);}public int ph(){  return lbal()-rbal();}int lbal(){  if(this.right== null){     return 0;  }     return (height(this.right));}int rbal(){   if(this.left == null){      return 0;   }  return height(this.left);}