data-structure-typed 1.42.8 → 1.42.9

package/test/integration/index.html

@@ -28,13 +28,13 @@
 
 
     const queue = new Queue();
-    for (let i = 0; i < 1000000; i++) {
+    for (let i = 0; i < 100000; i++) {
       queue.enqueue(i);
     }
     let last = 0;
     const startTime = performance.now();
 
-    for (let i = 0; i < 1000000; i++) {
+    for (let i = 0; i < 100000; i++) {
       last = queue.dequeue();
     }
 
@@ -44,6 +44,28 @@
     console.error(e);
   }
 
+  try {
+    const {BinaryTree} = dataStructureTyped;
+    const tree = new BinaryTree();
+    tree.add(3);
+    tree.add(12);
+    tree.addMany([1, 6, 9, 8,5,2,3,4,7])
+    tree.add(10);
+    console.log(tree.isPerfectlyBalanced());
+    tree.print();
+
+    const node3 = tree.getNode(3);
+    if (node3) node3.right = tree.createNode(1);
+    console.log(tree.isPerfectlyBalanced());
+    tree.print();
+
+    tree.clear();
+    tree.addMany([1, null, 2, null, 3, null, 4, null, 5, null, 6, null]);
+    console.log(tree.isPerfectlyBalanced());
+    tree.print();
+  } catch (e) {
+    console.error(e);
+  }
 </script>
 
 </body>

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

@@ -1,4 +1,5 @@
 import {BinaryTree, BinaryTreeNode, IterationType} from '../../../../src';
+import {getRandomIntArray} from "../../../utils";
 // import {isDebugTest} from '../../../config';
 
 // const isDebug = isDebugTest;
@@ -112,6 +113,24 @@ describe('BinaryTree', () => {
     expect(tree.has('3', node => node.value?.toString())).toBe(true);
   });
 
+
+  it('should be a balance tree after malicious manipulation', () => {
+    tree.add(3);
+    tree.add(12);
+    tree.addMany(getRandomIntArray(100, 1, 100))
+    tree.add(10);
+
+    expect(tree.isPerfectlyBalanced()).toBe(true);
+    const node3 = tree.getNode(3);
+
+    if (node3) node3.right = tree.createNode(1);
+    expect(tree.isPerfectlyBalanced()).toBe(false);
+
+    tree.clear();
+    tree.addMany([1, null, 2, null, 3, null, 4, null, 5, null, 6, null]);
+    expect(tree.isPerfectlyBalanced()).toBe(false);
+  });
+
   it('should getDepth return correct depth', () => {
     tree.add(1);
     expect(tree.getDepth(1)).toBe(0);
@@ -480,10 +499,8 @@ describe('BinaryTree', () => {
     tree.add(7, 'C');
 
     tree.iterationType = IterationType.ITERATIVE;
-    // @ts-ignore
     expect([...tree]).toEqual([3, 5, 7]);
     tree.iterationType = IterationType.RECURSIVE;
-    // @ts-ignore
     expect([...tree]).toEqual([3, 5, 7]);
     tree.iterationType = IterationType.ITERATIVE;
 

package/test/unit/data-structures/linked-list/doubly-linked-list.test.ts

@@ -54,7 +54,6 @@ describe('DoublyLinkedList Operation Test', () => {
   });
 
   it('should insertAfter tail', () => {
-    // @ts-ignore
     expect([...list]).toEqual([1, 2, 3, 4, 5]);
   });
 });

package/test/unit/data-structures/linked-list/singly-linked-list.test.ts

@@ -441,7 +441,6 @@ describe('SinglyLinkedList', () => {
     list.push(3);
     const array = list.toArray();
     expect(array).toEqual([1, 2, 3]);
-    // @ts-ignore
     expect([...list]).toEqual([1, 2, 3]);
   });