compression.diff

--- input/input.ts
+++ output/output.ts
@@ -55,27 +55,9 @@
   has(data: T): boolean {
     if (!this.rootNode) {
       return false
-    }
-
-    let currentNode = this.rootNode
-    while (currentNode.data !== data) {
-      if (data > currentNode.data) {
-        if (!currentNode.rightChild) {
-          return false
-        }
-
-        currentNode = currentNode.rightChild
-      } else {
-        if (!currentNode.leftChild) {
-          return false
-        }
-
-        currentNode = currentNode.leftChild
-      }
-    }
-
+    { … 19 line(s) … ⟦tj:c314b509a6e54416c9cb7e9eb985ca9e⟧ }
     return true
-  }
+}
 
   /**
    * Inserts the given data into the binary search tree.
@@ -86,63 +68,24 @@
   insert(data: T): void {
     if (!this.rootNode) {
       this.rootNode = new TreeNode<T>(data)
-      return
+    { … 20 line(s) … ⟦tj:d0937293e564ddc2c7605b529bb69e1d⟧ }
     }
+}
 
-    let currentNode: TreeNode<T> = this.rootNode
-    while (true) {
-      if (data > currentNode.data) {
-        if (currentNode.rightChild) {
-          currentNode = currentNode.rightChild
-        } else {
-          currentNode.rightChild = new TreeNode<T>(data)
-          return
-        }
-      } else {
-        if (currentNode.leftChild) {
-          currentNode = currentNode.leftChild
-        } else {
-          currentNode.leftChild = new TreeNode<T>(data)
-          return
-        }
-      }
-    }
-  }
-
   /**
    * Finds the minimum value of the binary search tree.
    *
    * @returns The minimum value of the binary search tree
    */
-  findMin(): T {
-    if (!this.rootNode) {
-      throw new Error('Empty tree.')
-    }
+  findMin(): T { … 11 line(s) … ⟦tj:e14172a42b670bc2cd911e1e5648775c⟧ }
 
-    const traverse = (node: TreeNode<T>): T => {
-      return !node.leftChild ? node.data : traverse(node.leftChild)
-    }
-
-    return traverse(this.rootNode)
-  }
-
   /**
    * Finds the maximum value of the binary search tree.
    *
    * @returns The maximum value of the binary search tree
    */
-  findMax(): T {
-    if (!this.rootNode) {
-      throw new Error('Empty tree.')
-    }
+  findMax(): T { … 11 line(s) … ⟦tj:3d7b9b43fd855181f4ccc90c6e752ec5⟧ }
 
-    const traverse = (node: TreeNode<T>): T => {
-      return !node.rightChild ? node.data : traverse(node.rightChild)
-    }
-
-    return traverse(this.rootNode)
-  }
-
   /**
    * Traverses to the binary search tree in in-order, i. e. it follow the schema of:
    * Left Node -> Root Node -> Right Node
@@ -153,21 +96,9 @@
   inOrderTraversal(array: T[] = []): T[] {
     if (!this.rootNode) {
       return array
-    }
-
-    const traverse = (node?: TreeNode<T>, array: T[] = []): T[] => {
-      if (!node) {
-        return array
-      }
-
-      traverse(node.leftChild, array)
-      array.push(node.data)
-      traverse(node.rightChild, array)
-      return array
-    }
-
+    { … 13 line(s) … ⟦tj:56a0cfe04911f60efc6baa21b22ee892⟧ }
     return traverse(this.rootNode)
-  }
+}
 
   /**
    * Traverses to the binary search tree in pre-order, i. e. it follow the schema of:
@@ -179,22 +110,9 @@
   preOrderTraversal(array: T[] = []): T[] {
     if (!this.rootNode) {
       return array
-    }
-
-    const traverse = (node?: TreeNode<T>, array: T[] = []): T[] => {
-      if (!node) {
-        return array
-      }
-
-      array.push(node.data)
-      traverse(node.leftChild, array)
-      traverse(node.rightChild, array)
-
-      return array
-    }
-
+    { … 14 line(s) … ⟦tj:3f4174a7b354ddfe8236979e1bb0e325⟧ }
     return traverse(this.rootNode)
-  }
+}
 
   /**
    * Traverses to the binary search tree in post-order, i. e. it follow the schema of:
@@ -206,20 +124,10 @@
   postOrderTraversal(array: T[] = []): T[] {
     if (!this.rootNode) {
       return array
-    }
-
-    const traverse = (node?: TreeNode<T>, array: T[] = []): T[] => {
-      if (!node) {
-        return array
-      }
-
-      traverse(node.leftChild, array)
-      traverse(node.rightChild, array)
-      array.push(node.data)
-
-      return array
-    }
-
+    { … 14 line(s) … ⟦tj:d2a4b84ecd9bb10491e2783baa27e559⟧ }
     return traverse(this.rootNode)
-  }
 }
+}
+[omitted blocks are individually retrievable: call tinyjuice_retrieve with the token inside an omission marker to expand just that block]
+
+[PARTIAL view — full original (5205 bytes): call tinyjuice_retrieve with token "c015bc624a6090ff6b3173a0417647b5"]
\ No newline at end of file