data-structure-typed 1.33.2 → 1.33.5

package/test/unit/data-structures/binary-tree/avl-tree.test.ts

@@ -2,7 +2,6 @@ import {AVLTree} from '../../../../src';
 
 describe('AVL Tree Test', () => {
   it('should perform various operations on a AVL Tree', () => {
-
     const arr = [11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5];
     const tree = new AVLTree();
 
@@ -16,7 +15,6 @@ describe('AVL Tree Test', () => {
     const getNodeById = tree.get(10, 'id');
     expect(getNodeById?.id).toBe(10);
 
-
     const getMinNodeByRoot = tree.getLeftMost();
     expect(getMinNodeByRoot?.id).toBe(1);
 
@@ -30,7 +28,6 @@ describe('AVL Tree Test', () => {
     const lesserSum = tree.lesserSum(10);
     expect(lesserSum).toBe(45);
 
-
     // node15 has type problem. After the uniform design, the generics of containers (DirectedGraph, BST) are based on the type of value. However, this design has a drawback: when I attempt to inherit from the Vertex or BSTNode classes, the types of the results obtained by all methods are those of the parent class.
     expect(node15?.val).toBe(15);
 
@@ -44,56 +41,56 @@ describe('AVL Tree Test', () => {
     expect(bfs[0].id).toBe(8);
     expect(bfs[bfs.length - 1].id).toBe(16);
 
-    expect(tree.remove(11, true)[0].deleted?.id).toBe(11);
+    expect(tree.remove(11)[0].deleted?.id).toBe(11);
     expect(tree.isAVLBalanced()).toBe(true);
     expect(node15 && tree.getHeight(node15)).toBe(2);
 
-    expect(tree.remove(1, true)[0].deleted?.id).toBe(1);
+    expect(tree.remove(1)[0].deleted?.id).toBe(1);
     expect(tree.isAVLBalanced()).toBe(true);
     expect(tree.getHeight()).toBe(4);
 
-    expect(tree.remove(4, true)[0].deleted?.id).toBe(4);
+    expect(tree.remove(4)[0].deleted?.id).toBe(4);
     expect(tree.isAVLBalanced()).toBe(true);
     expect(tree.getHeight()).toBe(4);
 
-    expect(tree.remove(10, true)[0].deleted?.id).toBe(10);
+    expect(tree.remove(10)[0].deleted?.id).toBe(10);
     expect(tree.isAVLBalanced()).toBe(true);
     expect(tree.getHeight()).toBe(3);
 
-    expect(tree.remove(15, true)[0].deleted?.id).toBe(15);
+    expect(tree.remove(15)[0].deleted?.id).toBe(15);
     expect(tree.isAVLBalanced()).toBe(true);
 
     expect(tree.getHeight()).toBe(3);
 
-    expect(tree.remove(5, true)[0].deleted?.id).toBe(5);
+    expect(tree.remove(5)[0].deleted?.id).toBe(5);
     expect(tree.isAVLBalanced()).toBe(true);
     expect(tree.getHeight()).toBe(3);
 
-    expect(tree.remove(13, true)[0].deleted?.id).toBe(13);
+    expect(tree.remove(13)[0].deleted?.id).toBe(13);
     expect(tree.isAVLBalanced()).toBe(true);
     expect(tree.getHeight()).toBe(3);
 
-    expect(tree.remove(3, true)[0].deleted?.id).toBe(3);
+    expect(tree.remove(3)[0].deleted?.id).toBe(3);
     expect(tree.isAVLBalanced()).toBe(true);
     expect(tree.getHeight()).toBe(3);
 
-    expect(tree.remove(8, true)[0].deleted?.id).toBe(8);
+    expect(tree.remove(8)[0].deleted?.id).toBe(8);
     expect(tree.isAVLBalanced()).toBe(true);
     expect(tree.getHeight()).toBe(3);
 
-    expect(tree.remove(6, true)[0].deleted?.id).toBe(6);
-    expect(tree.remove(6, true).length).toBe(0);
+    expect(tree.remove(6)[0].deleted?.id).toBe(6);
+    expect(tree.remove(6).length).toBe(0);
     expect(tree.isAVLBalanced()).toBe(true);
     expect(tree.getHeight()).toBe(2);
 
-    expect(tree.remove(7, true)[0].deleted?.id).toBe(7);
+    expect(tree.remove(7)[0].deleted?.id).toBe(7);
     expect(tree.isAVLBalanced()).toBe(true);
     expect(tree.getHeight()).toBe(2);
 
-    expect(tree.remove(9, true)[0].deleted?.id).toBe(9);
+    expect(tree.remove(9)[0].deleted?.id).toBe(9);
     expect(tree.isAVLBalanced()).toBe(true);
     expect(tree.getHeight()).toBe(2);
-    expect(tree.remove(14, true)[0].deleted?.id).toBe(14);
+    expect(tree.remove(14)[0].deleted?.id).toBe(14);
     expect(tree.isAVLBalanced()).toBe(true);
     expect(tree.getHeight()).toBe(1);
 

package/test/unit/data-structures/binary-tree/binary-tree.test.ts

@@ -75,7 +75,6 @@ describe('BinaryTreeNode', () => {
   });
 });
 
-
 describe('BinaryTree', () => {
   let binaryTree: BinaryTree;
 
@@ -102,10 +101,8 @@ describe('BinaryTree', () => {
       expect(result).toHaveLength(1);
       expect(binaryTree.size).toBe(0);
     }
-
   });
 
-
   test('should add and find nodes', () => {
     binaryTree.add(1);
     binaryTree.add(2);
@@ -143,4 +140,3 @@ describe('BinaryTree', () => {
     expect(binaryTree.root).toBeNull();
   });
 });
-

package/test/unit/data-structures/binary-tree/bst.test.ts

@@ -26,7 +26,6 @@ describe('BST operations test', () => {
     const nodeVal9 = bst.get(9, 'val');
     expect(nodeVal9?.id).toBe(9);
 
-
     const leftMost = bst.getLeftMost();
     expect(leftMost?.id).toBe(1);
 
@@ -56,7 +55,7 @@ describe('BST operations test', () => {
     expect(bfsNodesAfterBalanced[0].id).toBe(8);
     expect(bfsNodesAfterBalanced[bfsNodesAfterBalanced.length - 1].id).toBe(16);
 
-    const removed11 = bst.remove(11, true);
+    const removed11 = bst.remove(11);
     expect(removed11).toBeInstanceOf(Array);
     expect(removed11[0]).toBeDefined();
     expect(removed11[0].deleted).toBeDefined();
@@ -67,7 +66,7 @@ describe('BST operations test', () => {
 
     expect(bst.getHeight(15)).toBe(1);
 
-    const removed1 = bst.remove(1, true);
+    const removed1 = bst.remove(1);
     expect(removed1).toBeInstanceOf(Array);
     expect(removed1[0]).toBeDefined();
     expect(removed1[0].deleted).toBeDefined();
@@ -77,7 +76,7 @@ describe('BST operations test', () => {
 
     expect(bst.getHeight()).toBe(4);
 
-    const removed4 = bst.remove(4, true);
+    const removed4 = bst.remove(4);
     expect(removed4).toBeInstanceOf(Array);
     expect(removed4[0]).toBeDefined();
     expect(removed4[0].deleted).toBeDefined();
@@ -85,7 +84,7 @@ describe('BST operations test', () => {
     expect(bst.isAVLBalanced()).toBe(true);
     expect(bst.getHeight()).toBe(4);
 
-    const removed10 = bst.remove(10, true);
+    const removed10 = bst.remove(10);
     expect(removed10).toBeInstanceOf(Array);
     expect(removed10[0]).toBeDefined();
     expect(removed10[0].deleted).toBeDefined();
@@ -93,7 +92,7 @@ describe('BST operations test', () => {
     expect(bst.isAVLBalanced()).toBe(false);
     expect(bst.getHeight()).toBe(4);
 
-    const removed15 = bst.remove(15, true);
+    const removed15 = bst.remove(15);
     expect(removed15).toBeInstanceOf(Array);
     expect(removed15[0]).toBeDefined();
     expect(removed15[0].deleted).toBeDefined();
@@ -102,7 +101,7 @@ describe('BST operations test', () => {
     expect(bst.isAVLBalanced()).toBe(true);
     expect(bst.getHeight()).toBe(3);
 
-    const removed5 = bst.remove(5, true);
+    const removed5 = bst.remove(5);
     expect(removed5).toBeInstanceOf(Array);
     expect(removed5[0]).toBeDefined();
     expect(removed5[0].deleted).toBeDefined();
@@ -111,7 +110,7 @@ describe('BST operations test', () => {
     expect(bst.isAVLBalanced()).toBe(true);
     expect(bst.getHeight()).toBe(3);
 
-    const removed13 = bst.remove(13, true);
+    const removed13 = bst.remove(13);
     expect(removed13).toBeInstanceOf(Array);
     expect(removed13[0]).toBeDefined();
     expect(removed13[0].deleted).toBeDefined();
@@ -119,7 +118,7 @@ describe('BST operations test', () => {
     expect(bst.isAVLBalanced()).toBe(true);
     expect(bst.getHeight()).toBe(3);
 
-    const removed3 = bst.remove(3, true);
+    const removed3 = bst.remove(3);
     expect(removed3).toBeInstanceOf(Array);
     expect(removed3[0]).toBeDefined();
     expect(removed3[0].deleted).toBeDefined();
@@ -127,7 +126,7 @@ describe('BST operations test', () => {
     expect(bst.isAVLBalanced()).toBe(false);
     expect(bst.getHeight()).toBe(3);
 
-    const removed8 = bst.remove(8, true);
+    const removed8 = bst.remove(8);
     expect(removed8).toBeInstanceOf(Array);
     expect(removed8[0]).toBeDefined();
     expect(removed8[0].deleted).toBeDefined();
@@ -135,16 +134,16 @@ describe('BST operations test', () => {
     expect(bst.isAVLBalanced()).toBe(true);
     expect(bst.getHeight()).toBe(3);
 
-    const removed6 = bst.remove(6, true);
+    const removed6 = bst.remove(6);
     expect(removed6).toBeInstanceOf(Array);
     expect(removed6[0]).toBeDefined();
     expect(removed6[0].deleted).toBeDefined();
     if (removed6[0].deleted) expect(removed6[0].deleted.id).toBe(6);
-    expect(bst.remove(6, true).length).toBe(0);
+    expect(bst.remove(6).length).toBe(0);
     expect(bst.isAVLBalanced()).toBe(false);
     expect(bst.getHeight()).toBe(3);
 
-    const removed7 = bst.remove(7, true);
+    const removed7 = bst.remove(7);
     expect(removed7).toBeInstanceOf(Array);
     expect(removed7[0]).toBeDefined();
     expect(removed7[0].deleted).toBeDefined();
@@ -152,7 +151,7 @@ describe('BST operations test', () => {
     expect(bst.isAVLBalanced()).toBe(false);
     expect(bst.getHeight()).toBe(3);
 
-    const removed9 = bst.remove(9, true);
+    const removed9 = bst.remove(9);
     expect(removed9).toBeInstanceOf(Array);
     expect(removed9[0]).toBeDefined();
     expect(removed9[0].deleted).toBeDefined();
@@ -160,7 +159,7 @@ describe('BST operations test', () => {
     expect(bst.isAVLBalanced()).toBe(false);
     expect(bst.getHeight()).toBe(3);
 
-    const removed14 = bst.remove(14, true);
+    const removed14 = bst.remove(14);
     expect(removed14).toBeInstanceOf(Array);
     expect(removed14[0]).toBeDefined();
     expect(removed14[0].deleted).toBeDefined();
@@ -168,7 +167,6 @@ describe('BST operations test', () => {
     expect(bst.isAVLBalanced()).toBe(false);
     expect(bst.getHeight()).toBe(2);
 
-
     expect(bst.isAVLBalanced()).toBe(false);
 
     const bfsIDs = bst.BFS();
@@ -180,21 +178,34 @@ describe('BST operations test', () => {
     expect(bfsNodes[0].id).toBe(2);
     expect(bfsNodes[1].id).toBe(12);
     expect(bfsNodes[2].id).toBe(16);
-
   });
 
   it('should perform various operations on a Binary Search Tree with object values', () => {
-    const objBST = new BST<BSTNode<{ id: number, keyA: number }>>();
+    const objBST = new BST<BSTNode<{id: number; keyA: number}>>();
     expect(objBST).toBeInstanceOf(BST);
     objBST.add(11, {id: 11, keyA: 11});
     objBST.add(3, {id: 3, keyA: 3});
-    const values = [{id: 15, keyA: 15}, {id: 1, keyA: 1}, {id: 8, keyA: 8},
-      {id: 13, keyA: 13}, {id: 16, keyA: 16}, {id: 2, keyA: 2},
-      {id: 6, keyA: 6}, {id: 9, keyA: 9}, {id: 12, keyA: 12},
-      {id: 14, keyA: 14}, {id: 4, keyA: 4}, {id: 7, keyA: 7},
-      {id: 10, keyA: 10}, {id: 5, keyA: 5}];
-
-    objBST.addMany(values.map(item => item.id), values);
+    const values = [
+      {id: 15, keyA: 15},
+      {id: 1, keyA: 1},
+      {id: 8, keyA: 8},
+      {id: 13, keyA: 13},
+      {id: 16, keyA: 16},
+      {id: 2, keyA: 2},
+      {id: 6, keyA: 6},
+      {id: 9, keyA: 9},
+      {id: 12, keyA: 12},
+      {id: 14, keyA: 14},
+      {id: 4, keyA: 4},
+      {id: 7, keyA: 7},
+      {id: 10, keyA: 10},
+      {id: 5, keyA: 5}
+    ];
+
+    objBST.addMany(
+      values.map(item => item.id),
+      values
+    );
 
     expect(objBST.root).toBeInstanceOf(BSTNode);
 
@@ -242,7 +253,7 @@ describe('BST operations test', () => {
     expect(bfsNodesAfterBalanced[0].id).toBe(8);
     expect(bfsNodesAfterBalanced[bfsNodesAfterBalanced.length - 1].id).toBe(16);
 
-    const removed11 = objBST.remove(11, true);
+    const removed11 = objBST.remove(11);
     expect(removed11).toBeInstanceOf(Array);
     expect(removed11[0]).toBeDefined();
     expect(removed11[0].deleted).toBeDefined();
@@ -253,7 +264,7 @@ describe('BST operations test', () => {
 
     expect(node15 && objBST.getHeight(node15)).toBe(2);
 
-    const removed1 = objBST.remove(1, true);
+    const removed1 = objBST.remove(1);
     expect(removed1).toBeInstanceOf(Array);
     expect(removed1[0]).toBeDefined();
     expect(removed1[0].deleted).toBeDefined();
@@ -263,7 +274,7 @@ describe('BST operations test', () => {
 
     expect(objBST.getHeight()).toBe(4);
 
-    const removed4 = objBST.remove(4, true);
+    const removed4 = objBST.remove(4);
     expect(removed4).toBeInstanceOf(Array);
     expect(removed4[0]).toBeDefined();
     expect(removed4[0].deleted).toBeDefined();
@@ -271,7 +282,7 @@ describe('BST operations test', () => {
     expect(objBST.isAVLBalanced()).toBe(true);
     expect(objBST.getHeight()).toBe(4);
 
-    const removed10 = objBST.remove(10, true);
+    const removed10 = objBST.remove(10);
     expect(removed10).toBeInstanceOf(Array);
     expect(removed10[0]).toBeDefined();
     expect(removed10[0].deleted).toBeDefined();
@@ -279,7 +290,7 @@ describe('BST operations test', () => {
     expect(objBST.isAVLBalanced()).toBe(false);
     expect(objBST.getHeight()).toBe(4);
 
-    const removed15 = objBST.remove(15, true);
+    const removed15 = objBST.remove(15);
     expect(removed15).toBeInstanceOf(Array);
     expect(removed15[0]).toBeDefined();
     expect(removed15[0].deleted).toBeDefined();
@@ -288,7 +299,7 @@ describe('BST operations test', () => {
     expect(objBST.isAVLBalanced()).toBe(true);
     expect(objBST.getHeight()).toBe(3);
 
-    const removed5 = objBST.remove(5, true);
+    const removed5 = objBST.remove(5);
     expect(removed5).toBeInstanceOf(Array);
     expect(removed5[0]).toBeDefined();
     expect(removed5[0].deleted).toBeDefined();
@@ -297,7 +308,7 @@ describe('BST operations test', () => {
     expect(objBST.isAVLBalanced()).toBe(true);
     expect(objBST.getHeight()).toBe(3);
 
-    const removed13 = objBST.remove(13, true);
+    const removed13 = objBST.remove(13);
     expect(removed13).toBeInstanceOf(Array);
     expect(removed13[0]).toBeDefined();
     expect(removed13[0].deleted).toBeDefined();
@@ -305,7 +316,7 @@ describe('BST operations test', () => {
     expect(objBST.isAVLBalanced()).toBe(true);
     expect(objBST.getHeight()).toBe(3);
 
-    const removed3 = objBST.remove(3, true);
+    const removed3 = objBST.remove(3);
     expect(removed3).toBeInstanceOf(Array);
     expect(removed3[0]).toBeDefined();
     expect(removed3[0].deleted).toBeDefined();
@@ -313,7 +324,7 @@ describe('BST operations test', () => {
     expect(objBST.isAVLBalanced()).toBe(false);
     expect(objBST.getHeight()).toBe(3);
 
-    const removed8 = objBST.remove(8, true);
+    const removed8 = objBST.remove(8);
     expect(removed8).toBeInstanceOf(Array);
     expect(removed8[0]).toBeDefined();
     expect(removed8[0].deleted).toBeDefined();
@@ -321,16 +332,16 @@ describe('BST operations test', () => {
     expect(objBST.isAVLBalanced()).toBe(true);
     expect(objBST.getHeight()).toBe(3);
 
-    const removed6 = objBST.remove(6, true);
+    const removed6 = objBST.remove(6);
     expect(removed6).toBeInstanceOf(Array);
     expect(removed6[0]).toBeDefined();
     expect(removed6[0].deleted).toBeDefined();
     if (removed6[0].deleted) expect(removed6[0].deleted.id).toBe(6);
-    expect(objBST.remove(6, true).length).toBe(0);
+    expect(objBST.remove(6).length).toBe(0);
     expect(objBST.isAVLBalanced()).toBe(false);
     expect(objBST.getHeight()).toBe(3);
 
-    const removed7 = objBST.remove(7, true);
+    const removed7 = objBST.remove(7);
     expect(removed7).toBeInstanceOf(Array);
     expect(removed7[0]).toBeDefined();
     expect(removed7[0].deleted).toBeDefined();
@@ -338,7 +349,7 @@ describe('BST operations test', () => {
     expect(objBST.isAVLBalanced()).toBe(false);
     expect(objBST.getHeight()).toBe(3);
 
-    const removed9 = objBST.remove(9, true);
+    const removed9 = objBST.remove(9);
     expect(removed9).toBeInstanceOf(Array);
     expect(removed9[0]).toBeDefined();
     expect(removed9[0].deleted).toBeDefined();
@@ -346,7 +357,7 @@ describe('BST operations test', () => {
     expect(objBST.isAVLBalanced()).toBe(false);
     expect(objBST.getHeight()).toBe(3);
 
-    const removed14 = objBST.remove(14, true);
+    const removed14 = objBST.remove(14);
     expect(removed14).toBeInstanceOf(Array);
     expect(removed14[0]).toBeDefined();
     expect(removed14[0].deleted).toBeDefined();
@@ -354,7 +365,6 @@ describe('BST operations test', () => {
     expect(objBST.isAVLBalanced()).toBe(false);
     expect(objBST.getHeight()).toBe(2);
 
-
     expect(objBST.isAVLBalanced()).toBe(false);
 
     const bfsIDs = objBST.BFS();
@@ -366,6 +376,5 @@ describe('BST operations test', () => {
     expect(bfsNodes[0].id).toBe(2);
     expect(bfsNodes[1].id).toBe(12);
     expect(bfsNodes[2].id).toBe(16);
-
   });
 });

package/test/unit/data-structures/binary-tree/overall.test.ts

@@ -6,52 +6,60 @@ describe('Overall BinaryTree Test', () => {
     bst.add(11);
     bst.add(3);
     bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
-    bst.size === 16;        // true
-    expect(bst.size).toBe(16);        // true
-    bst.has(6);             // true
-    expect(bst.has(6)).toBe(true);             // true
-    const node6 = bst.get(6);
+    bst.size === 16; // true
+    expect(bst.size).toBe(16); // true
+    bst.has(6); // true
+    expect(bst.has(6)).toBe(true); // true
     bst.getHeight(6) === 2; // true
-    bst.getHeight() === 5;  // true
-    bst.getDepth(6) === 3;  // true
+    bst.getHeight() === 5; // true
+    bst.getDepth(6) === 3; // true
     expect(bst.getHeight(6)).toBe(2); // true
-    expect(bst.getHeight()).toBe(5);  // true
-    expect(bst.getDepth(6)).toBe(3);  // true
+    expect(bst.getHeight()).toBe(5); // true
+    expect(bst.getDepth(6)).toBe(3); // true
     const leftMost = bst.getLeftMost();
-    leftMost?.id === 1;      // true
+    leftMost?.id === 1; // true
     expect(leftMost?.id).toBe(1);
     bst.remove(6);
-    bst.get(6);             // null
+    bst.get(6); // null
     expect(bst.get(6)).toBeNull();
-    bst.isAVLBalanced();    // true or false
+    bst.isAVLBalanced(); // true or false
     expect(bst.isAVLBalanced()).toBe(true);
     const bfsIDs = bst.BFS();
-    bfsIDs[0] === 11;   // true
+    bfsIDs[0] === 11; // true
     expect(bfsIDs[0]).toBe(11);
 
-    const objBST = new BST<BSTNode<{ id: number, keyA: number }>>();
+    const objBST = new BST<BSTNode<{id: number; keyA: number}>>();
     objBST.add(11, {id: 11, keyA: 11});
     objBST.add(3, {id: 3, keyA: 3});
 
-    objBST.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5],
+    objBST.addMany(
+      [15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5],
       [
-        {id: 15, keyA: 15}, {id: 1, keyA: 1}, {id: 8, keyA: 8},
-        {id: 13, keyA: 13}, {id: 16, keyA: 16}, {id: 2, keyA: 2},
-        {id: 6, keyA: 6}, {id: 9, keyA: 9}, {id: 12, keyA: 12},
-        {id: 14, keyA: 14}, {id: 4, keyA: 4}, {id: 7, keyA: 7},
-        {id: 10, keyA: 10}, {id: 5, keyA: 5}
-      ]);
+        {id: 15, keyA: 15},
+        {id: 1, keyA: 1},
+        {id: 8, keyA: 8},
+        {id: 13, keyA: 13},
+        {id: 16, keyA: 16},
+        {id: 2, keyA: 2},
+        {id: 6, keyA: 6},
+        {id: 9, keyA: 9},
+        {id: 12, keyA: 12},
+        {id: 14, keyA: 14},
+        {id: 4, keyA: 4},
+        {id: 7, keyA: 7},
+        {id: 10, keyA: 10},
+        {id: 5, keyA: 5}
+      ]
+    );
 
     objBST.remove(11);
 
-
     const avlTree = new AVLTree();
-    avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
-    avlTree.isAVLBalanced();    // true
-    expect(avlTree.isAVLBalanced()).toBe(true);    // true
+    avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
+    avlTree.isAVLBalanced(); // true
+    expect(avlTree.isAVLBalanced()).toBe(true); // true
     avlTree.remove(10);
-    avlTree.isAVLBalanced();    // true
-    expect(avlTree.isAVLBalanced()).toBe(true);       // true
-
+    avlTree.isAVLBalanced(); // true
+    expect(avlTree.isAVLBalanced()).toBe(true); // true
   });
 });

package/test/unit/data-structures/binary-tree/rb-tree.test.ts

@@ -40,5 +40,4 @@ describe('Red-Black Tree Tests', () => {
     //
     // expect(inOrderTraversal).toEqual([2, 4, 5, 6, 7, 8]);
   });
-
 });

package/test/unit/data-structures/binary-tree/tree-multiset.test.ts

@@ -15,7 +15,7 @@ describe('TreeMultiset operations test', () => {
 
     expect(treeMultiset.size).toBe(16);
     expect(treeMultiset.count).toBe(18);
-    expect(treeMultiset.BFS('id'))
+    expect(treeMultiset.BFS('id'));
 
     expect(treeMultiset.has(6));
 
@@ -44,7 +44,6 @@ describe('TreeMultiset operations test', () => {
     const lesserSum = treeMultiset.lesserSum(10);
     expect(lesserSum).toBe(45);
 
-
     expect(node15 instanceof TreeMultisetNode);
     if (node15 instanceof TreeMultisetNode) {
       const subTreeAdd = treeMultiset.subTreeAddCount(15, 1);
@@ -204,17 +203,31 @@ describe('TreeMultiset operations test', () => {
   });
 
   it('should perform various operations on a Binary Search Tree with object values', () => {
-    const objTreeMultiset = new TreeMultiset<TreeMultisetNode<{ id: number, keyA: number }>>();
+    const objTreeMultiset = new TreeMultiset<TreeMultisetNode<{id: number; keyA: number}>>();
     expect(objTreeMultiset).toBeInstanceOf(TreeMultiset);
     objTreeMultiset.add(11, {id: 11, keyA: 11});
     objTreeMultiset.add(3, {id: 3, keyA: 3});
-    const values = [{id: 15, keyA: 15}, {id: 1, keyA: 1}, {id: 8, keyA: 8},
-      {id: 13, keyA: 13}, {id: 16, keyA: 16}, {id: 2, keyA: 2},
-      {id: 6, keyA: 6}, {id: 9, keyA: 9}, {id: 12, keyA: 12},
-      {id: 14, keyA: 14}, {id: 4, keyA: 4}, {id: 7, keyA: 7},
-      {id: 10, keyA: 10}, {id: 5, keyA: 5}];
-
-    objTreeMultiset.addMany(values.map(item => item.id), values);
+    const values = [
+      {id: 15, keyA: 15},
+      {id: 1, keyA: 1},
+      {id: 8, keyA: 8},
+      {id: 13, keyA: 13},
+      {id: 16, keyA: 16},
+      {id: 2, keyA: 2},
+      {id: 6, keyA: 6},
+      {id: 9, keyA: 9},
+      {id: 12, keyA: 12},
+      {id: 14, keyA: 14},
+      {id: 4, keyA: 4},
+      {id: 7, keyA: 7},
+      {id: 10, keyA: 10},
+      {id: 5, keyA: 5}
+    ];
+
+    objTreeMultiset.addMany(
+      values.map(item => item.id),
+      values
+    );
 
     expect(objTreeMultiset.root).toBeInstanceOf(TreeMultisetNode);
 
@@ -414,7 +427,6 @@ describe('TreeMultiset Performance test', function () {
   // }
 
   it(`Observe the time consumption of TreeMultiset.add fitting O(n log n)`, function () {
-
     // // Create a benchmark suite
     // const suite = new Benchmark.Suite();
     // // Define a function to generate a random array of a given size
@@ -446,5 +458,4 @@ describe('TreeMultiset Performance test', function () {
     //   })
     //   .run({async: true});
   });
-
 });