feat: 리밸런싱에 필요한 도구 리밸런스 메서드 정의

Author: ksundong

yoonexample/src/main/java/search/binarysearchtree/AVLTreeNode.java

@@ -71,4 +71,23 @@ private BinaryTreeNode<E> rotateRL(BinaryTreeNode<E> binaryTreeNode) {
     parentNode.changeRightSubTree(rotateLL(childNode)); // 부분적 LL회전
     return rotateRR(parentNode); // RR회전
   }
+
+  private void rebalance() {
+    int equilibriumFactor = getEquilibriumFactor(super.node);
+
+    if (equilibriumFactor > 1) { // LL OR LR
+      if (getEquilibriumFactor(super.node.getLeftSubTree()) > 0) {
+        super.node = rotateLL(super.node);
+      } else {
+        super.node = rotateLR(super.node);
+      }
+    }
+    if (equilibriumFactor < -1) { // RR OR RL
+      if (getEquilibriumFactor(super.node.getRightSubTree()) < 0) {
+        super.node = rotateRR(super.node);
+      } else {
+        super.node = rotateRL(super.node);
+      }
+    }
+  }
 }

yoonexample/src/main/java/search/binarysearchtree/LinkedBinarySearchTreeNode.java

@@ -7,7 +7,7 @@
 public class LinkedBinarySearchTreeNode<E> implements BinarySearchTreeNode<E> {
 
   private final Comparator<E> comparator;
-  private BinaryTreeNode<E> node;
+  protected BinaryTreeNode<E> node;
 
   public LinkedBinarySearchTreeNode(E data, Comparator<E> comparator) {
     this.node = new LinkedBinaryTreeNode<>(data);