compression.diff

--- input/input.php
+++ output/output.php
@@ -141,22 +141,10 @@
      * @return AVLTreeNode The new root of the subtree.
      */
     private function insertNode(?AVLTreeNode $node, $key, $value): AVLTreeNode
-    {
         if ($node === null) {
             return new AVLTreeNode($key, $value);
-        }
-
-        if ($key < $node->key) {
-            $node->left = $this->insertNode($node->left, $key, $value);
-        } elseif ($key > $node->key) {
-            $node->right = $this->insertNode($node->right, $key, $value);
-        } else {
-            $node->value = $value; // Update existing value
-        }
-
-        $node->updateHeight();
+        { … 11 line(s) … ⟦tj:1f85c720d2794424f7b63e0c0cd9fbaf⟧ }
         return $this->balance($node);
-    }
 
     /**
      * Delete a node by its key and balance the tree.
@@ -166,32 +154,10 @@
      * @return ?AVLTreeNode The new root of the subtree.
      */
     private function deleteNode(?AVLTreeNode $node, $key): ?AVLTreeNode
-    {
         if ($node === null) {
             return null;
-        }
-
-        if ($key < $node->key) {
-            $node->left = $this->deleteNode($node->left, $key);
-        } elseif ($key > $node->key) {
-            $node->right = $this->deleteNode($node->right, $key);
-        } else {
-            if (!$node->left) {
-                return $node->right;
-            }
-            if (!$node->right) {
-                return $node->left;
-            }
-
-            $minNode = $this->getMinNode($node->right);
-            $node->key = $minNode->key;
-            $node->value = $minNode->value;
-            $node->right = $this->deleteNode($node->right, $minNode->key);
-        }
-
-        $node->updateHeight();
+        { … 21 line(s) … ⟦tj:d2099f1a1c8a684f62150eb21ef2daf3⟧ }
         return $this->balance($node);
-    }
 
     /**
      * Search for a node by its key.
@@ -201,20 +167,8 @@
      * @return ?AVLTreeNode The node with the specified key, or null if not found.
      */
     private function searchNode(?AVLTreeNode $node, $key): ?AVLTreeNode
-    {
-        if ($node === null) {
-            return null;
-        }
+        { … 13 line(s) … ⟦tj:b1974e13206d1c8c10c35cb52775392d⟧ }
 
-        if ($key < $node->key) {
-            return $this->searchNode($node->left, $key);
-        } elseif ($key > $node->key) {
-            return $this->searchNode($node->right, $key);
-        } else {
-            return $node;
-        }
-    }
-
     /**
      * Helper method to check if a subtree is balanced.
      *
@@ -222,21 +176,10 @@
      * @return bool True if the subtree is balanced, false otherwise.
      */
     private function isBalancedHelper(?AVLTreeNode $node): bool
-    {
         if ($node === null) {
             return true;
-        }
-
-        $leftHeight = $node->left ? $node->left->height : 0;
-        $rightHeight = $node->right ? $node->right->height : 0;
-
-        $balanceFactor = abs($leftHeight - $rightHeight);
-        if ($balanceFactor > 1) {
-            return false;
-        }
-
+        { … 10 line(s) … ⟦tj:7108266228c2b805d9fb13214052fcb8⟧ }
         return $this->isBalancedHelper($node->left) && $this->isBalancedHelper($node->right);
-    }
 
     /**
      * Balance the subtree rooted at the given node.
@@ -245,23 +188,10 @@
      * @return ?AVLTreeNode The new root of the subtree.
      */
     private function balance(?AVLTreeNode $node): ?AVLTreeNode
-    {
         if ($node->balanceFactor() > 1) {
             if ($node->left && $node->left->balanceFactor() < 0) {
-                $node->left = $this->rotateLeft($node->left);
-            }
-            return $this->rotateRight($node);
-        }
-
-        if ($node->balanceFactor() < -1) {
-            if ($node->right && $node->right->balanceFactor() > 0) {
-                $node->right = $this->rotateRight($node->right);
-            }
-            return $this->rotateLeft($node);
-        }
-
+        { … 12 line(s) … ⟦tj:daedcf3b47d14501e52639fab961630c⟧ }
         return $node;
-    }
 
     /**
      * Perform a left rotation on the given node.
@@ -270,17 +200,8 @@
      * @return AVLTreeNode The new root of the rotated subtree.
      */
     private function rotateLeft(AVLTreeNode $node): AVLTreeNode
-    {
-        $newRoot = $node->right;
-        $node->right = $newRoot->left;
-        $newRoot->left = $node;
+        { … 10 line(s) … ⟦tj:2205efd9f1b2327cdf3bab8094fdb330⟧ }
 
-        $node->updateHeight();
-        $newRoot->updateHeight();
-
-        return $newRoot;
-    }
-
     /**
      * Perform a right rotation on the given node.
      *
@@ -288,17 +209,8 @@
      * @return AVLTreeNode The new root of the rotated subtree.
      */
     private function rotateRight(AVLTreeNode $node): AVLTreeNode
-    {
-        $newRoot = $node->left;
-        $node->left = $newRoot->right;
-        $newRoot->right = $node;
+        { … 10 line(s) … ⟦tj:80ddac9d729b1c0926a235345502cf46⟧ }
 
-        $node->updateHeight();
-        $newRoot->updateHeight();
-
-        return $newRoot;
-    }
-
     /**
      * Get the node with the minimum key in the given subtree.
      *
@@ -330,18 +242,7 @@
      * @return array
      */
     private function serializeTree(?AVLTreeNode $node): array
-    {
-        if ($node === null) {
-            return [];
-        }
-        return [
-            'key' => $node->key,
-            'value' => $node->value,
-            'left' => $this->serializeTree($node->left),
-            'right' => $this->serializeTree($node->right),
-            'height' => $node->height,
-        ];
-    }
+        { … 12 line(s) … ⟦tj:2bd4a83f13002f1aa499640a397f3305⟧ }
 
     /**
      * Deserializes a JSON string into an AVL Tree object
@@ -362,20 +263,8 @@
      * @return AVLTreeNode|null The root node of the deserialized tree.
      */
     private function deserializeTree(array $data): ?AVLTreeNode
-    {
-        if (empty($data)) {
-            return null;
-        }
+        { … 13 line(s) … ⟦tj:b14a194381e273565db250f4eb27f8d9⟧ }
 
-        $node = new AVLTreeNode($data['key'], $data['value']);
-        $node->height = $data['height'];
-
-        $node->left = $this->deserializeTree($data['left']);
-        $node->right = $this->deserializeTree($data['right']);
-
-        return $node;
-    }
-
     /**
      * Updates the deserialized tree size.
      *
@@ -390,3 +279,6 @@
         }
     }
 }
+[omitted blocks are individually retrievable: call tinyjuice_retrieve with the token inside an omission marker to expand just that block]
+
+[PARTIAL view — full original (10922 bytes): call tinyjuice_retrieve with token "4bd1128cfb4ef95215250a8fe19d8989"]
\ No newline at end of file