data-structure-typed 1.41.6 → 1.41.8

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

@@ -0,0 +1,66 @@
+import {AVLTree, BST} from '../../../../src';
+
+describe('Overall BinaryTree Test', () => {
+  it('should perform various operations on BinaryTree', () => {
+    const bst = new BST();
+    bst.add(11);
+    bst.add(3);
+    bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5], undefined, false);
+    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
+    expect(bst.getHeight(6)).toBe(2); // true
+    expect(bst.getHeight()).toBe(5); // true
+    expect(bst.getDepth(6)).toBe(3); // true
+    const leftMost = bst.getLeftMost();
+    leftMost?.key === 1; // true
+    expect(leftMost?.key).toBe(1);
+    bst.delete(6);
+    bst.getNode(6); // null
+    expect(bst.getNode(6)).toBeNull();
+    bst.isAVLBalanced(); // true or false
+    expect(bst.isAVLBalanced()).toBe(true);
+    const bfsIDs: number[] = [];
+    bst.bfs(node => bfsIDs.push(node.key));
+    bfsIDs[0] === 11; // true
+    expect(bfsIDs[0]).toBe(11);
+
+    const objBST = new BST<{key: number; keyA: number}>();
+    objBST.add(11, {key: 11, keyA: 11});
+    objBST.add(3, {key: 3, keyA: 3});
+
+    objBST.addMany(
+      [15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5],
+      [
+        {key: 15, keyA: 15},
+        {key: 1, keyA: 1},
+        {key: 8, keyA: 8},
+        {key: 13, keyA: 13},
+        {key: 16, keyA: 16},
+        {key: 2, keyA: 2},
+        {key: 6, keyA: 6},
+        {key: 9, keyA: 9},
+        {key: 12, keyA: 12},
+        {key: 14, keyA: 14},
+        {key: 4, keyA: 4},
+        {key: 7, keyA: 7},
+        {key: 10, keyA: 10},
+        {key: 5, keyA: 5}
+      ]
+    );
+
+    objBST.delete(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.delete(10);
+    avlTree.isAVLBalanced(); // true
+    expect(avlTree.isAVLBalanced()).toBe(true); // true
+  });
+});

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

@@ -0,0 +1,435 @@
+import {NIL, RBTNColor, RBTreeNode, RedBlackTree} from '../../../../src';
+import {getRandomInt} from '../../../utils';
+import {isDebugTest} from '../../../config';
+
+const isDebug = isDebugTest;
+
+describe('RedBlackTree', () => {
+  let tree: RedBlackTree;
+
+  beforeEach(() => {
+    tree = new RedBlackTree();
+  });
+
+  describe('add and getNode', () => {
+    test('should add and find a node in the tree', () => {
+      tree.add(10);
+      tree.add(20);
+      tree.add(5);
+
+      expect(tree.getNode(10)).toBeInstanceOf(RBTreeNode);
+      expect(tree.getNode(20)).toBeInstanceOf(RBTreeNode);
+      expect(tree.getNode(5)).toBeInstanceOf(RBTreeNode);
+      expect(tree.getNode(15)).toBe(null);
+    });
+
+    test('should add and find nodes with negative keys', () => {
+      tree.add(-10);
+      tree.add(-20);
+
+      expect(tree.getNode(-10)).toBeInstanceOf(RBTreeNode);
+      expect(tree.getNode(-20)).toBeInstanceOf(RBTreeNode);
+    });
+  });
+
+  describe('deleteNode', () => {
+    test('should delete a node from the tree', () => {
+      tree.add(10);
+      tree.add(20);
+      tree.add(5);
+      tree.delete(20);
+
+      expect(tree.getNode(20)).toBe(null);
+    });
+
+    test('should handle deleting a non-existent node', () => {
+      tree.add(10);
+      tree.add(20);
+      tree.add(5);
+      tree.delete(15);
+
+      expect(tree.getNode(15)).toBe(null);
+    });
+  });
+
+  describe('minimum', () => {
+    test('should find the minimum node in the tree', () => {
+      tree.add(10);
+      tree.add(20);
+      tree.add(5);
+      tree.add(15);
+      tree.add(3);
+
+      const minNode = tree.getLeftMost(tree.root);
+      expect(minNode.key).toBe(3);
+    });
+
+    test('should handle an empty tree', () => {
+      const minNode = tree.getLeftMost(tree.root);
+      expect(minNode).toBe(NIL);
+    });
+  });
+
+  describe('getRightMost', () => {
+    test('should find the getRightMost node in the tree', () => {
+      tree.add(10);
+      tree.add(20);
+      tree.add(5);
+      tree.add(15);
+      tree.add(25);
+
+      const maxNode = tree.getRightMost(tree.root);
+      expect(maxNode.key).toBe(25);
+    });
+
+    test('should handle an empty tree', () => {
+      const maxNode = tree.getRightMost(tree.root);
+      expect(maxNode).toBe(NIL);
+    });
+  });
+
+  describe('getSuccessor', () => {
+    test('should find the getSuccessor of a node', () => {
+      tree.add(10);
+      tree.add(20);
+      tree.add(5);
+      tree.add(15);
+      tree.add(25);
+
+      const node = tree.getNode(15);
+      const successorNode = tree.getSuccessor(node);
+
+      expect(successorNode.key).toBe(20);
+    });
+
+    test('should handle a node with no getSuccessor', () => {
+      tree.add(10);
+      tree.add(5);
+
+      const node = tree.getNode(10);
+      const successorNode = tree.getSuccessor(node);
+      // TODO not sure if it should be null or NIL
+      expect(successorNode).toBe(null);
+    });
+  });
+
+  describe('getPredecessor', () => {
+    test('should find the getPredecessor of a node', () => {
+      tree.add(10);
+      tree.add(20);
+      tree.add(5);
+      tree.add(15);
+      tree.add(25);
+
+      const node = tree.getNode(20);
+      const predecessorNode = tree.getPredecessor(node);
+
+      expect(predecessorNode.key).toBe(15);
+    });
+
+    test('should handle a node with no getPredecessor', () => {
+      tree.add(10);
+      tree.add(20);
+
+      const node = tree.getNode(20);
+      const predecessorNode = tree.getPredecessor(node);
+      // TODO not sure if it should be NIL or something else.
+      expect(predecessorNode).toBe(tree.getNode(10));
+    });
+  });
+});
+
+describe('RedBlackTree', () => {
+  let tree: RedBlackTree;
+
+  beforeEach(() => {
+    tree = new RedBlackTree();
+  });
+
+  it('should add nodes into the tree', () => {
+    tree.add(10);
+    expect(tree.getNode(10)).toBeDefined();
+    tree.add(20);
+    expect(tree.getNode(20)).toBeDefined();
+    tree.add(5);
+    expect(tree.getNode(5)).toBeDefined();
+  });
+
+  it('should delete nodes from the tree', () => {
+    tree.add(10);
+    tree.add(20);
+    tree.add(5);
+    tree.delete(20);
+    expect(tree.getNode(20)).toBe(null);
+  });
+
+  it('should get the successor of a node', () => {
+    tree.add(10);
+    tree.add(20);
+    const node = tree.getNode(10);
+    const successor = tree.getSuccessor(node);
+    expect(successor?.key).toBe(20);
+  });
+
+  it('should get the predecessor of a node', () => {
+    tree.add(10);
+    tree.add(20);
+    const node = tree.getNode(20);
+    const predecessor = tree.getPredecessor(node);
+    expect(predecessor?.key).toBe(10);
+  });
+
+  it('should rotate nodes to the left', () => {
+    tree.add(10);
+    tree.add(20);
+    tree.add(5);
+    const node = tree.getNode(10);
+    tree.add(15);
+    // Verify that rotation has occurred
+    expect(node.left.key).toBe(5);
+    expect(node.right.key).toBe(20);
+  });
+
+  it('should rotate nodes to the right', () => {
+    tree.add(10);
+    tree.add(20);
+    tree.add(5);
+    const node = tree.getNode(20);
+    tree.add(25);
+    // Verify that rotation has occurred
+    expect(node.left.key).toBe(0);
+    expect(node.right.key).toBe(25);
+  });
+
+  it('should all node attributes fully conform to the red-black tree standards.', () => {
+    tree.add(10);
+    tree.add(20);
+    tree.add(5);
+    tree.add(15);
+    tree.add(21);
+    tree.add(6);
+    tree.add(2);
+
+    let node10F = tree.getNode(10);
+    let node20F = tree.getNode(20);
+    let node5F = tree.getNode(5);
+    let node15F = tree.getNode(15);
+    let node21F = tree.getNode(21);
+    let node6F = tree.getNode(6);
+    let node2F = tree.getNode(2);
+    expect(node10F.key).toBe(10);
+    expect(node10F.color).toBe(RBTNColor.BLACK);
+    expect(node10F.left).toBe(node5F);
+    expect(node10F.right).toBe(node20F);
+    expect(node10F.parent).toBe(null);
+    expect(node20F.key).toBe(20);
+    expect(node20F.color).toBe(RBTNColor.BLACK);
+    expect(node20F.left).toBe(node15F);
+    expect(node20F.right).toBe(node21F);
+    expect(node20F.parent).toBe(node10F);
+    expect(node5F.key).toBe(5);
+    expect(node5F.color).toBe(RBTNColor.BLACK);
+    expect(node5F.left).toBe(node2F);
+    expect(node5F.right).toBe(node6F);
+    expect(node5F.parent).toBe(node10F);
+    expect(node15F.key).toBe(15);
+    expect(node15F.color).toBe(RBTNColor.RED);
+    expect(node15F.left).toBe(NIL);
+    expect(node15F.right).toBe(NIL);
+    expect(node15F.parent).toBe(node20F);
+    expect(node21F.key).toBe(21);
+    expect(node21F.color).toBe(RBTNColor.RED);
+    expect(node21F.left).toBe(NIL);
+    expect(node21F.right).toBe(NIL);
+    expect(node21F.parent).toBe(node20F);
+    expect(node6F.key).toBe(6);
+    expect(node6F.color).toBe(RBTNColor.RED);
+    expect(node6F.left).toBe(NIL);
+    expect(node6F.right).toBe(NIL);
+    expect(node6F.parent).toBe(node5F);
+    expect(node2F.key).toBe(2);
+    expect(node2F.color).toBe(RBTNColor.RED);
+    expect(node2F.left).toBe(NIL);
+    expect(node2F.right).toBe(NIL);
+    expect(node2F.parent).toBe(node5F);
+    expect(node15F.key).toBe(15);
+    expect(node15F.color).toBe(RBTNColor.RED);
+    expect(node15F.left).toBe(NIL);
+    expect(node15F.right).toBe(NIL);
+    expect(node15F.parent).toBe(node20F);
+    tree.delete(5);
+    node10F = tree.getNode(10);
+    node20F = tree.getNode(20);
+    node5F = tree.getNode(5);
+    node15F = tree.getNode(15);
+    node21F = tree.getNode(21);
+    node6F = tree.getNode(6);
+    node2F = tree.getNode(2);
+    expect(node10F.key).toBe(10);
+    expect(node10F.color).toBe(RBTNColor.BLACK);
+    expect(node10F.left).toBe(node6F);
+    expect(node10F.right).toBe(node20F);
+    expect(node10F.parent).toBe(null);
+    expect(node20F.key).toBe(20);
+    expect(node20F.color).toBe(RBTNColor.BLACK);
+    expect(node20F.left).toBe(node15F);
+    expect(node20F.right).toBe(node21F);
+    expect(node20F.parent).toBe(node10F);
+    expect(node5F).toBe(null);
+    expect(node15F.key).toBe(15);
+    expect(node15F.color).toBe(RBTNColor.RED);
+    expect(node15F.left).toBe(NIL);
+    expect(node15F.right).toBe(NIL);
+    expect(node15F.parent).toBe(node20F);
+    expect(node21F.key).toBe(21);
+    expect(node21F.color).toBe(RBTNColor.RED);
+    expect(node21F.left).toBe(NIL);
+    expect(node21F.right).toBe(NIL);
+    expect(node21F.parent).toBe(node20F);
+    expect(node6F.key).toBe(6);
+    expect(node6F.color).toBe(RBTNColor.BLACK);
+    expect(node6F.left).toBe(node2F);
+    expect(node6F.right).toBe(NIL);
+    expect(node6F.parent).toBe(node10F);
+    expect(node2F.key).toBe(2);
+    expect(node2F.color).toBe(RBTNColor.RED);
+    expect(node2F.left).toBe(NIL);
+    expect(node2F.right).toBe(NIL);
+    expect(node2F.parent).toBe(node6F);
+    expect(node15F.key).toBe(15);
+    expect(node15F.color).toBe(RBTNColor.RED);
+    expect(node15F.left).toBe(NIL);
+    expect(node15F.right).toBe(NIL);
+    expect(node15F.parent).toBe(node20F);
+    tree.delete(20);
+    node10F = tree.getNode(10);
+    node20F = tree.getNode(20);
+    node5F = tree.getNode(5);
+    node15F = tree.getNode(15);
+    node21F = tree.getNode(21);
+    node6F = tree.getNode(6);
+    node2F = tree.getNode(2);
+    expect(node10F.key).toBe(10);
+    expect(node10F.color).toBe(RBTNColor.BLACK);
+    expect(node10F.left).toBe(node6F);
+    expect(node10F.right).toBe(node21F);
+    expect(node10F.parent).toBe(null);
+    expect(node20F).toBe(null);
+    expect(node5F).toBe(null);
+    expect(node15F.key).toBe(15);
+    expect(node15F.color).toBe(RBTNColor.RED);
+    expect(node15F.left).toBe(NIL);
+    expect(node15F.right).toBe(NIL);
+    expect(node15F.parent).toBe(node21F);
+    expect(node21F.key).toBe(21);
+    expect(node21F.color).toBe(RBTNColor.BLACK);
+    expect(node21F.left).toBe(node15F);
+    expect(node21F.right).toBe(NIL);
+    expect(node21F.parent).toBe(node10F);
+    expect(node6F.key).toBe(6);
+    expect(node6F.color).toBe(RBTNColor.BLACK);
+    expect(node6F.left).toBe(node2F);
+    expect(node6F.right).toBe(NIL);
+    expect(node6F.parent).toBe(node10F);
+    expect(node2F.key).toBe(2);
+    expect(node2F.color).toBe(RBTNColor.RED);
+    expect(node2F.left).toBe(NIL);
+    expect(node2F.right).toBe(NIL);
+    expect(node2F.parent).toBe(node6F);
+    expect(node15F.key).toBe(15);
+    expect(node15F.color).toBe(RBTNColor.RED);
+    expect(node15F.left).toBe(NIL);
+    expect(node15F.right).toBe(NIL);
+    expect(node15F.parent).toBe(node21F);
+  });
+
+  it('should fix the tree after insertion', () => {
+    tree.add(1);
+    tree.add(2);
+    tree.add(5);
+    tree.add(15);
+    const node15F = tree.getNode(15);
+    expect(node15F.left).toBe(NIL);
+    expect(node15F.right).toBe(NIL);
+    expect(node15F.parent).toBe(tree.getNode(5));
+
+    tree.add(25);
+    tree.add(10);
+    tree.add(8);
+    tree.add(28);
+    tree.add(111);
+    tree.add(12);
+    tree.delete(2);
+    tree.add(22);
+    tree.add(50);
+    tree.add(155);
+    tree.add(225);
+    const node225F = tree.getNode(225);
+    expect(node225F.left).toBe(NIL);
+    expect(node225F.right).toBe(NIL);
+    expect(node225F.parent.key).toBe(155);
+    tree.add(7);
+
+    const node15S = tree.getNode(15);
+    expect(node15S.left.key).toBe(8);
+    expect(node15S.right.key).toBe(28);
+    expect(node15S).toBe(tree.root);
+    expect(node15S.parent).toBe(null);
+    tree.delete(15);
+    expect(tree.root.key).toBe(22);
+    expect(tree.root.parent).toBe(null);
+
+    const node15T = tree.getNode(15);
+    expect(node15T).toBe(null);
+
+    tree.add(23);
+    tree.add(33);
+    tree.add(15);
+
+    const nodeLM = tree.getLeftMost();
+    expect(nodeLM.key).toBe(1);
+
+    const node50 = tree.getNode(50);
+    expect(node50.key).toBe(50);
+    expect(node50.left.key).toBe(33);
+    expect(node50.right).toBe(NIL);
+    const node15Fo = tree.getNode(15);
+
+    expect(node15Fo.key).toBe(15);
+    expect(node15Fo.left).toBe(NIL);
+    const node225S = tree.getNode(225);
+    expect(node225S.left).toBe(NIL);
+    expect(node225S.right).toBe(NIL);
+    expect(node225S.parent.key).toBe(155);
+    expect(tree.getNode(0)).toBe(null);
+    tree.add(1);
+    tree.add(2);
+    tree.add(3);
+    tree.add(4);
+    tree.add(5);
+    tree.add(6);
+    tree.add(7);
+    tree.add(8);
+    tree.add(9);
+    tree.add(10);
+    tree.add(11);
+    tree.add(12);
+    tree.add(13);
+    tree.add(14);
+    tree.add(15);
+    tree.add(16);
+    tree.add(17);
+    tree.add(18);
+    tree.add(19);
+    tree.add(110);
+
+    isDebug && tree.print();
+  });
+
+  it('should fix the tree after insertion and deletion', () => {
+    for (let i = 0; i < 100; i++) {
+      tree.add(getRandomInt(-100, 1000));
+      tree.delete(getRandomInt(-100, 1000));
+    }
+  });
+});

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

@@ -0,0 +1,50 @@
+import {SegmentTree} from '../../../../src';
+
+describe('SegmentTree', () => {
+  let segmentTree: SegmentTree;
+
+  beforeEach(() => {
+    // Create an example SegmentTree for testing
+    const values = [1, 2, 3, 4, 5];
+    segmentTree = new SegmentTree(values);
+  });
+
+  it('should build a valid segment tree', () => {
+    // Check if the root node's sum is correct
+    expect(segmentTree.root?.sum).toBe(15);
+  });
+
+  it('should update a node in the segment tree', () => {
+    // Update a node value
+    segmentTree.updateNode(2, 10);
+
+    // Check if the sum of the root node is correct after the update
+    expect(segmentTree.root?.sum).toBe(22);
+  });
+
+  it('should query sum by range correctly', () => {
+    // Check if the sum within a specific range is correct
+    expect(segmentTree.querySumByRange(1, 3)).toBe(9); // 2 + 3 + 4 = 9
+  });
+
+  it('should handle edge cases for querySumByRange', () => {
+    // Check behavior when the range goes beyond boundaries
+    expect(segmentTree.querySumByRange(0, 4)).toBe(15); // Valid range, should return sum of the specified range
+    expect(segmentTree.querySumByRange(3, 2)).toBe(NaN); // End index is less than start index, should return NaN
+    expect(segmentTree.querySumByRange(0, 10)).toBe(NaN); // Beyond upper bound, should return NaN
+  });
+
+  it('should handle an empty input array', () => {
+    // Check behavior when dealing with an empty input array
+    const emptySegmentTree = new SegmentTree([]);
+    expect(emptySegmentTree.root).toBe(null);
+    expect(emptySegmentTree.querySumByRange(0, 2)).toBe(0); // Sum of an empty array should be 0
+  });
+
+  it('should handle a single-element input array', () => {
+    // Check behavior when the input array contains a single element
+    const singleElementSegmentTree = new SegmentTree([42]);
+    expect(singleElementSegmentTree.root?.sum).toBe(42);
+    expect(singleElementSegmentTree.querySumByRange(0, 0)).toBe(42); // Range covering the only element should return that element's value
+  });
+});