data-structure-typed 1.50.5 → 1.50.7

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

@@ -8,17 +8,19 @@ import {
   TreeMultiMapNode
 } from '../../../../src';
 import { isDebugTest } from '../../../config';
+import { getRandomInt } from '../../../utils';
 
 const isDebug = isDebugTest;
 // const isDebug = true;
 
 describe('TreeMultiMap count', () => {
-  let tm: TreeMultiMap<number>;
+  let tmm: TreeMultiMap<number>;
   beforeEach(() => {
-    tm = new TreeMultiMap<number>();
+    tmm = new TreeMultiMap<number>();
   });
-  it('Should added isolated node count ', () => {
-    tm.addMany([
+
+  it('Should added node count ', () => {
+    tmm.addMany([
       [1, 1],
       [2, 2],
       [3, 3],
@@ -26,28 +28,84 @@ describe('TreeMultiMap count', () => {
       [5, 5]
     ]);
     const newNode = new TreeMultiMapNode(3, 33, 10);
-    tm.add(newNode);
-    expect(tm.count).toBe(15);
+    tmm.add(newNode);
+    expect(tmm.count).toBe(15);
+    expect(tmm.getMutableCount()).toBe(15);
+    expect(tmm.getNode(3)?.count).toBe(11);
   });
 
   it('Should count', () => {
-    tm.addMany([
+    tmm.addMany([
       [1, 1],
       [2, 2],
       [3, 3]
     ]);
-    tm.lesserOrGreaterTraverse(node => (node.count += 2), CP.gt, 1);
-    expect(tm.count).toBe(7);
+    tmm.lesserOrGreaterTraverse(node => (node.count += 2), CP.gt, 1);
+    expect(tmm.getMutableCount()).toBe(7);
+    expect(tmm.count).toBe(3);
   });
 });
 
 describe('TreeMultiMap operations test1', () => {
+  it('should height ', () => {
+    const tmm = new TreeMultiMap();
+    expect(tmm.getHeight()).toBe(-1);
+    expect(tmm.getMinHeight()).toBe(-1);
+
+    tmm.addMany([1, 6, 7, 2, 3, 4, 9, 11, 8, 5, 10, 12, 16, 14, 13, 15]);
+    expect(tmm.getHeight()).toBe(5);
+    expect(tmm.getMinHeight()).toBe(2);
+  });
+
+  it('should size and count', () => {
+    const tmm = new TreeMultiMap();
+
+    expect(tmm instanceof TreeMultiMap);
+
+    tmm.add([11, 11]);
+    tmm.add([3, 3]);
+    expect(tmm.count).toBe(2);
+    expect(tmm.getMutableCount()).toBe(2);
+    expect(tmm.size).toBe(2);
+
+    const keyValuePairs: [number, number][] = [
+      [11, 11],
+      [3, 3],
+      [15, 15],
+      [1, 1],
+      [8, 8],
+      [13, 13],
+      [16, 16],
+      [2, 2],
+      [6, 6],
+      [9, 9],
+      [12, 12],
+      [14, 14],
+      [4, 4],
+      [7, 7],
+      [10, 10],
+      [5, 5]
+    ];
+
+    tmm.addMany(keyValuePairs);
+    expect(tmm.size).toBe(16);
+    expect(tmm.count).toBe(18);
+    expect(tmm.getMutableCount()).toBe(18);
+    tmm.delete(11);
+    expect(tmm.count).toBe(17);
+    expect(tmm.getMutableCount()).toBe(17);
+    tmm.delete(3, undefined, true);
+    expect(tmm.count).toBe(15);
+    expect(tmm.getMutableCount()).toBe(15);
+  });
+
   it('should perform various operations on a Binary Search Tree with numeric values1', () => {
-    const treeMultimap = new TreeMultiMap();
+    const tmm = new TreeMultiMap();
+
+    expect(tmm instanceof TreeMultiMap);
 
-    expect(treeMultimap instanceof TreeMultiMap);
-    treeMultimap.add([11, 11]);
-    treeMultimap.add([3, 3]);
+    tmm.add([11, 11]);
+    tmm.add([3, 3]);
     const idAndValues: [number, number][] = [
       [11, 11],
       [3, 3],
@@ -66,199 +124,200 @@ describe('TreeMultiMap operations test1', () => {
       [10, 10],
       [5, 5]
     ];
-    treeMultimap.addMany(idAndValues);
-    expect(treeMultimap.root instanceof TreeMultiMapNode);
-
-    if (treeMultimap.root) expect(treeMultimap.root.key == 11);
+    tmm.addMany(idAndValues);
+    expect(tmm.root instanceof TreeMultiMapNode);
 
-    expect(treeMultimap.size).toBe(16);
-    expect(treeMultimap.count).toBe(18);
+    if (tmm.root) expect(tmm.root.key == 11);
 
-    expect(treeMultimap.has(6));
+    expect(tmm.size).toBe(16);
+    expect(tmm.count).toBe(18);
+    expect(tmm.getMutableCount()).toBe(18);
 
-    expect(treeMultimap.getHeight(6)).toBe(2);
-    expect(treeMultimap.getDepth(6)).toBe(4);
-    const nodeId10 = treeMultimap.getNode(10);
+    expect(tmm.has(6));
+    isDebug && tmm.print();
+    expect(tmm.getHeight(6)).toBe(1);
+    expect(tmm.getDepth(6)).toBe(3);
+    const nodeId10 = tmm.getNode(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = treeMultimap.getNode(9, node => node.value);
+    const nodeVal9 = tmm.getNode(9, node => node.value);
     expect(nodeVal9?.key).toBe(9);
 
-    const nodesByCount1 = treeMultimap.getNodes(1, node => node.count);
+    const nodesByCount1 = tmm.getNodes(1, node => node.count);
     expect(nodesByCount1.length).toBe(14);
 
-    const nodesByCount2 = treeMultimap.getNodes(2, node => node.count);
+    const nodesByCount2 = tmm.getNodes(2, node => node.count);
     expect(nodesByCount2.length).toBe(2);
-    const leftMost = treeMultimap.getLeftMost();
+    const leftMost = tmm.getLeftMost();
     expect(leftMost?.key).toBe(1);
 
-    const node15 = treeMultimap.getNode(15);
-    const minNodeBySpecificNode = node15 && treeMultimap.getLeftMost(node15);
-    expect(minNodeBySpecificNode?.key).toBe(15);
+    const node15 = tmm.getNode(15);
+    const minNodeBySpecificNode = node15 && tmm.getLeftMost(node15);
+    expect(minNodeBySpecificNode?.key).toBe(14);
 
     let subTreeSum = 0;
-    node15 && treeMultimap.dfs(node => (subTreeSum += node.key), 'pre', 15);
-    expect(subTreeSum).toBe(31);
+    node15 && tmm.dfs(node => (subTreeSum += node.key), 'pre', 15);
+    expect(subTreeSum).toBe(45);
     let lesserSum = 0;
-    treeMultimap.lesserOrGreaterTraverse((node: TreeMultiMapNode<number>) => (lesserSum += node.key), CP.lt, 10);
+    tmm.lesserOrGreaterTraverse((node: TreeMultiMapNode<number>) => (lesserSum += node.key), CP.lt, 10);
     expect(lesserSum).toBe(45);
 
     expect(node15 instanceof TreeMultiMapNode);
     if (node15 instanceof TreeMultiMapNode) {
-      const subTreeAdd = treeMultimap.dfs(node => (node.count += 1), 'pre', 15);
+      const subTreeAdd = tmm.dfs(node => (node.count += 1), 'pre', 15);
       expect(subTreeAdd);
     }
-    const node11 = treeMultimap.getNode(11);
+    const node11 = tmm.getNode(11);
     expect(node11 instanceof TreeMultiMapNode);
     if (node11 instanceof TreeMultiMapNode) {
-      const allGreaterNodesAdded = treeMultimap.lesserOrGreaterTraverse(node => (node.count += 2), CP.gt, 11);
+      const allGreaterNodesAdded = tmm.lesserOrGreaterTraverse(node => (node.count += 2), CP.gt, 11);
       expect(allGreaterNodesAdded);
     }
 
-    const dfsInorderNodes = treeMultimap.dfs(node => node, 'in');
+    const dfsInorderNodes = tmm.dfs(node => node, 'in');
     expect(dfsInorderNodes[0].key).toBe(1);
     expect(dfsInorderNodes[dfsInorderNodes.length - 1].key).toBe(16);
-    expect(treeMultimap.isPerfectlyBalanced()).toBe(false);
+    expect(tmm.isPerfectlyBalanced()).toBe(false);
+    tmm.perfectlyBalance();
+    expect(tmm.isPerfectlyBalanced()).toBe(false);
 
-    treeMultimap.perfectlyBalance();
+    expect(tmm.isAVLBalanced()).toBe(false);
 
-    expect(treeMultimap.isPerfectlyBalanced()).toBe(true);
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-
-    const bfsNodesAfterBalanced = treeMultimap.bfs(node => node);
-    expect(bfsNodesAfterBalanced[0].key).toBe(8);
+    const bfsNodesAfterBalanced = tmm.bfs(node => node);
+    expect(bfsNodesAfterBalanced[0].key).toBe(6);
     expect(bfsNodesAfterBalanced[bfsNodesAfterBalanced.length - 1].key).toBe(16);
 
-    const removed11 = treeMultimap.delete(11, undefined, true);
+    const removed11 = tmm.delete(11, undefined, true);
     expect(removed11 instanceof Array);
     expect(removed11[0]);
     expect(removed11[0].deleted);
 
     if (removed11[0].deleted) expect(removed11[0].deleted.key).toBe(11);
 
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
+    expect(tmm.isAVLBalanced()).toBe(false);
 
-    expect(treeMultimap.getHeight(15)).toBe(2);
+    expect(tmm.getHeight(15)).toBe(1);
 
-    const removed1 = treeMultimap.delete(1, undefined, true);
+    const removed1 = tmm.delete(1, undefined, true);
     expect(removed1 instanceof Array);
     expect(removed1[0]);
     expect(removed1[0].deleted);
     if (removed1[0].deleted) expect(removed1[0].deleted.key).toBe(1);
 
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
+    expect(tmm.isAVLBalanced()).toBe(false);
 
-    expect(treeMultimap.getHeight()).toBe(5);
+    expect(tmm.getHeight()).toBe(5);
 
-    const removed4 = treeMultimap.delete(4, undefined, true);
+    const removed4 = tmm.delete(4, undefined, true);
     expect(removed4 instanceof Array);
     expect(removed4[0]);
     expect(removed4[0].deleted);
     if (removed4[0].deleted) expect(removed4[0].deleted.key).toBe(4);
 
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(5);
+    expect(tmm.isAVLBalanced()).toBe(false);
+    expect(tmm.getHeight()).toBe(5);
 
-    const removed10 = treeMultimap.delete(10, undefined, true);
+    const removed10 = tmm.delete(10, undefined, true);
     expect(removed10 instanceof Array);
     expect(removed10[0]);
     expect(removed10[0].deleted);
     if (removed10[0].deleted) expect(removed10[0].deleted.key).toBe(10);
-    expect(treeMultimap.isAVLBalanced()).toBe(false);
+    expect(tmm.isAVLBalanced()).toBe(false);
 
-    expect(treeMultimap.getHeight()).toBe(5);
+    expect(tmm.getHeight()).toBe(4);
 
-    const removed15 = treeMultimap.delete(15, undefined, true);
+    const removed15 = tmm.delete(15, undefined, true);
     expect(removed15 instanceof Array);
     expect(removed15[0]);
     expect(removed15[0].deleted);
     if (removed15[0].deleted) expect(removed15[0].deleted.key).toBe(15);
 
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.isAVLBalanced()).toBe(false);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed5 = treeMultimap.delete(5, undefined, true);
+    const removed5 = tmm.delete(5, undefined, true);
     expect(removed5 instanceof Array);
     expect(removed5[0]);
     expect(removed5[0].deleted);
     if (removed5[0].deleted) expect(removed5[0].deleted.key).toBe(5);
 
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.isAVLBalanced()).toBe(true);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed13 = treeMultimap.delete(13, undefined, true);
+    const removed13 = tmm.delete(13, undefined, true);
     expect(removed13 instanceof Array);
     expect(removed13[0]);
     expect(removed13[0].deleted);
     if (removed13[0].deleted) expect(removed13[0].deleted.key).toBe(13);
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.isAVLBalanced()).toBe(true);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed3 = treeMultimap.delete(3, undefined, true);
+    const removed3 = tmm.delete(3, undefined, true);
     expect(removed3 instanceof Array);
     expect(removed3[0]);
     expect(removed3[0].deleted);
     if (removed3[0].deleted) expect(removed3[0].deleted.key).toBe(3);
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.isAVLBalanced()).toBe(false);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed8 = treeMultimap.delete(8, undefined, true);
+    const removed8 = tmm.delete(8, undefined, true);
     expect(removed8 instanceof Array);
     expect(removed8[0]);
     expect(removed8[0].deleted);
     if (removed8[0].deleted) expect(removed8[0].deleted.key).toBe(8);
-    expect(treeMultimap.isAVLBalanced()).toBe(false);
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.isAVLBalanced()).toBe(false);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed6 = treeMultimap.delete(6, undefined, true);
+    const removed6 = tmm.delete(6, undefined, true);
     expect(removed6 instanceof Array);
     expect(removed6[0]);
     expect(removed6[0].deleted);
     if (removed6[0].deleted) expect(removed6[0].deleted.key).toBe(6);
-    expect(treeMultimap.delete(6, undefined, true).length).toBe(0);
-    expect(treeMultimap.isAVLBalanced()).toBe(false);
+    expect(tmm.delete(6, undefined, true).length).toBe(0);
+    expect(tmm.isAVLBalanced()).toBe(false);
 
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed7 = treeMultimap.delete(7, undefined, true);
+    const removed7 = tmm.delete(7, undefined, true);
     expect(removed7 instanceof Array);
     expect(removed7[0]);
     expect(removed7[0].deleted);
     if (removed7[0].deleted) expect(removed7[0].deleted.key).toBe(7);
-    expect(treeMultimap.isAVLBalanced()).toBe(false);
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.isAVLBalanced()).toBe(false);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed9 = treeMultimap.delete(9, undefined, true);
+    const removed9 = tmm.delete(9, undefined, true);
     expect(removed9 instanceof Array);
     expect(removed9[0]);
     expect(removed9[0].deleted);
     if (removed9[0].deleted) expect(removed9[0].deleted.key).toBe(9);
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(3);
+    expect(tmm.isAVLBalanced()).toBe(true);
+    expect(tmm.getHeight()).toBe(2);
 
-    const removed14 = treeMultimap.delete(14, undefined, true);
+    const removed14 = tmm.delete(14, undefined, true);
     expect(removed14 instanceof Array);
     expect(removed14[0]);
     expect(removed14[0].deleted);
     if (removed14[0].deleted) expect(removed14[0].deleted.key).toBe(14);
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(2);
+    expect(tmm.isAVLBalanced()).toBe(true);
+    expect(tmm.getHeight()).toBe(1);
 
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
+    expect(tmm.isAVLBalanced()).toBe(true);
 
-    const bfsIDs = treeMultimap.bfs(node => node.key);
+    const bfsIDs = tmm.bfs(node => node.key);
 
     expect(bfsIDs[0]).toBe(12);
     expect(bfsIDs[1]).toBe(2);
     expect(bfsIDs[2]).toBe(16);
 
-    const bfsNodes = treeMultimap.bfs(node => node);
+    const bfsNodes = tmm.bfs(node => node);
 
     expect(bfsNodes[0].key).toBe(12);
     expect(bfsNodes[1].key).toBe(2);
     expect(bfsNodes[2].key).toBe(16);
 
-    expect(treeMultimap.count).toBe(8);
+    expect(tmm.count).toBe(6);
+    expect(tmm.getMutableCount()).toBe(8);
   });
 
   it('should perform various operations on a Binary Search Tree with object values', () => {
@@ -287,9 +346,10 @@ describe('TreeMultiMap operations test1', () => {
 
     expect(objTreeMultiMap.root).toBeInstanceOf(TreeMultiMapNode);
 
-    if (objTreeMultiMap.root) expect(objTreeMultiMap.root.key).toBe(11);
+    if (objTreeMultiMap.root) expect(objTreeMultiMap.root.key).toBe(5);
 
     expect(objTreeMultiMap.count).toBe(16);
+    expect(objTreeMultiMap.getMutableCount()).toBe(16);
 
     expect(objTreeMultiMap.has(6)).toBe(true);
   });
@@ -297,11 +357,11 @@ describe('TreeMultiMap operations test1', () => {
 
 describe('TreeMultiMap operations test recursively1', () => {
   it('should perform various operations on a Binary Search Tree with numeric values1', () => {
-    const treeMultimap = new TreeMultiMap<number>([], { iterationType: IterationType.RECURSIVE });
+    const tmm = new TreeMultiMap<number>([], { iterationType: IterationType.RECURSIVE });
 
-    expect(treeMultimap instanceof TreeMultiMap);
-    treeMultimap.add([11, 11]);
-    treeMultimap.add([3, 3]);
+    expect(tmm instanceof TreeMultiMap);
+    tmm.add([11, 11]);
+    tmm.add([3, 3]);
     const idAndValues: [number, number][] = [
       [11, 11],
       [3, 3],
@@ -320,42 +380,43 @@ describe('TreeMultiMap operations test recursively1', () => {
       [10, 10],
       [5, 5]
     ];
-    treeMultimap.addMany(idAndValues);
-    expect(treeMultimap.root).toBeInstanceOf(TreeMultiMapNode);
+    tmm.addMany(idAndValues);
+    expect(tmm.root).toBeInstanceOf(TreeMultiMapNode);
 
-    if (treeMultimap.root) expect(treeMultimap.root.key).toBe(11);
+    if (tmm.root) expect(tmm.root.key).toBe(5);
 
-    expect(treeMultimap.size).toBe(16);
-    expect(treeMultimap.count).toBe(18);
+    expect(tmm.size).toBe(16);
+    expect(tmm.count).toBe(18);
+    expect(tmm.getMutableCount()).toBe(18);
 
-    expect(treeMultimap.has(6));
+    expect(tmm.has(6));
 
-    expect(treeMultimap.getHeight(6)).toBe(2);
-    expect(treeMultimap.getDepth(6)).toBe(4);
-    const nodeId10 = treeMultimap.getNode(10);
+    expect(tmm.getHeight(6)).toBe(1);
+    expect(tmm.getDepth(6)).toBe(3);
+    const nodeId10 = tmm.getNode(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = treeMultimap.getNode(9, node => node.value);
+    const nodeVal9 = tmm.getNode(9, node => node.value);
     expect(nodeVal9?.key).toBe(9);
 
-    const nodesByCount1 = treeMultimap.getNodes(1, node => node.count);
+    const nodesByCount1 = tmm.getNodes(1, node => node.count);
     expect(nodesByCount1.length).toBe(14);
 
-    const nodesByCount2 = treeMultimap.getNodes(2, node => node.count);
+    const nodesByCount2 = tmm.getNodes(2, node => node.count);
     expect(nodesByCount2.length).toBe(2);
-    const leftMost = treeMultimap.getLeftMost();
+    const leftMost = tmm.getLeftMost();
     expect(leftMost?.key).toBe(1);
 
-    const node15 = treeMultimap.getNode(15);
-    const minNodeBySpecificNode = node15 && treeMultimap.getLeftMost(node15);
-    expect(minNodeBySpecificNode?.key).toBe(15);
+    const node15 = tmm.getNode(15);
+    const minNodeBySpecificNode = node15 && tmm.getLeftMost(node15);
+    expect(minNodeBySpecificNode?.key).toBe(14);
 
     let subTreeSum = 0;
-    node15 && treeMultimap.dfs(node => (subTreeSum += node.key), 'pre', 15);
-    expect(subTreeSum).toBe(31);
+    node15 && tmm.dfs(node => (subTreeSum += node.key), 'pre', 15);
+    expect(subTreeSum).toBe(45);
     let lesserSum = 0;
-    expect(treeMultimap.has(9)).toBe(true);
-    treeMultimap.lesserOrGreaterTraverse(
+    expect(tmm.has(9)).toBe(true);
+    tmm.lesserOrGreaterTraverse(
       node => {
         lesserSum += node.key;
         return node.key;
@@ -367,160 +428,161 @@ describe('TreeMultiMap operations test recursively1', () => {
 
     expect(node15 instanceof TreeMultiMapNode);
     if (node15 instanceof TreeMultiMapNode) {
-      const subTreeAdd = treeMultimap.dfs(node => (node.count += 1), 'pre', 15);
+      const subTreeAdd = tmm.dfs(node => (node.count += 1), 'pre', 15);
       expect(subTreeAdd);
     }
-    const node11 = treeMultimap.getNode(11);
+    const node11 = tmm.getNode(11);
     expect(node11 instanceof TreeMultiMapNode);
     if (node11 instanceof TreeMultiMapNode) {
-      const allGreaterNodesAdded = treeMultimap.lesserOrGreaterTraverse(node => (node.count += 2), CP.gt, 11);
+      const allGreaterNodesAdded = tmm.lesserOrGreaterTraverse(node => (node.count += 2), CP.gt, 11);
       expect(allGreaterNodesAdded);
     }
 
-    const dfsInorderNodes = treeMultimap.dfs(node => node, 'in');
+    const dfsInorderNodes = tmm.dfs(node => node, 'in');
     expect(dfsInorderNodes[0].key).toBe(1);
     expect(dfsInorderNodes[dfsInorderNodes.length - 1].key).toBe(16);
-    expect(treeMultimap.isPerfectlyBalanced()).toBe(false);
+    expect(tmm.isPerfectlyBalanced()).toBe(false);
 
-    treeMultimap.perfectlyBalance();
+    tmm.perfectlyBalance();
 
-    expect(treeMultimap.isPerfectlyBalanced()).toBe(true);
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
+    expect(tmm.isPerfectlyBalanced()).toBe(false);
+    expect(tmm.isAVLBalanced()).toBe(false);
 
-    const bfsNodesAfterBalanced = treeMultimap.bfs(node => node);
-    expect(bfsNodesAfterBalanced[0].key).toBe(8);
+    const bfsNodesAfterBalanced = tmm.bfs(node => node);
+    expect(bfsNodesAfterBalanced[0].key).toBe(6);
     expect(bfsNodesAfterBalanced[bfsNodesAfterBalanced.length - 1].key).toBe(16);
 
-    const removed11 = treeMultimap.delete(11, undefined, true);
+    const removed11 = tmm.delete(11, undefined, true);
     expect(removed11 instanceof Array);
     expect(removed11[0]);
     expect(removed11[0].deleted);
 
     if (removed11[0].deleted) expect(removed11[0].deleted.key).toBe(11);
 
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
+    expect(tmm.isAVLBalanced()).toBe(false);
 
-    expect(treeMultimap.getHeight(15)).toBe(2);
+    expect(tmm.getHeight(15)).toBe(1);
 
-    const removed1 = treeMultimap.delete(1, undefined, true);
+    const removed1 = tmm.delete(1, undefined, true);
     expect(removed1 instanceof Array);
     expect(removed1[0]);
     expect(removed1[0].deleted);
     if (removed1[0].deleted) expect(removed1[0].deleted.key).toBe(1);
 
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
+    expect(tmm.isAVLBalanced()).toBe(false);
 
-    expect(treeMultimap.getHeight()).toBe(5);
+    expect(tmm.getHeight()).toBe(5);
 
-    const removed4 = treeMultimap.delete(4, undefined, true);
+    const removed4 = tmm.delete(4, undefined, true);
     expect(removed4 instanceof Array);
     expect(removed4[0]);
     expect(removed4[0].deleted);
     if (removed4[0].deleted) expect(removed4[0].deleted.key).toBe(4);
 
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(5);
+    expect(tmm.isAVLBalanced()).toBe(false);
+    expect(tmm.getHeight()).toBe(5);
 
-    const removed10 = treeMultimap.delete(10, undefined, true);
+    const removed10 = tmm.delete(10, undefined, true);
     expect(removed10 instanceof Array);
     expect(removed10[0]);
     expect(removed10[0].deleted);
     if (removed10[0].deleted) expect(removed10[0].deleted.key).toBe(10);
-    expect(treeMultimap.isAVLBalanced()).toBe(false);
+    expect(tmm.isAVLBalanced()).toBe(false);
 
-    expect(treeMultimap.getHeight()).toBe(5);
+    expect(tmm.getHeight()).toBe(4);
 
-    const removed15 = treeMultimap.delete(15, undefined, true);
+    const removed15 = tmm.delete(15, undefined, true);
     expect(removed15 instanceof Array);
     expect(removed15[0]);
     expect(removed15[0].deleted);
     if (removed15[0].deleted) expect(removed15[0].deleted.key).toBe(15);
 
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.isAVLBalanced()).toBe(false);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed5 = treeMultimap.delete(5, undefined, true);
+    const removed5 = tmm.delete(5, undefined, true);
     expect(removed5 instanceof Array);
     expect(removed5[0]);
     expect(removed5[0].deleted);
     if (removed5[0].deleted) expect(removed5[0].deleted.key).toBe(5);
 
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.isAVLBalanced()).toBe(true);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed13 = treeMultimap.delete(13, undefined, true);
+    const removed13 = tmm.delete(13, undefined, true);
     expect(removed13 instanceof Array);
     expect(removed13[0]);
     expect(removed13[0].deleted);
     if (removed13[0].deleted) expect(removed13[0].deleted.key).toBe(13);
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.isAVLBalanced()).toBe(true);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed3 = treeMultimap.delete(3, undefined, true);
+    const removed3 = tmm.delete(3, undefined, true);
     expect(removed3 instanceof Array);
     expect(removed3[0]);
     expect(removed3[0].deleted);
     if (removed3[0].deleted) expect(removed3[0].deleted.key).toBe(3);
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.isAVLBalanced()).toBe(false);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed8 = treeMultimap.delete(8, undefined, true);
+    const removed8 = tmm.delete(8, undefined, true);
     expect(removed8 instanceof Array);
     expect(removed8[0]);
     expect(removed8[0].deleted);
     if (removed8[0].deleted) expect(removed8[0].deleted.key).toBe(8);
-    expect(treeMultimap.isAVLBalanced()).toBe(false);
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.isAVLBalanced()).toBe(false);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed6 = treeMultimap.delete(6, undefined, true);
+    const removed6 = tmm.delete(6, undefined, true);
     expect(removed6 instanceof Array);
     expect(removed6[0]);
     expect(removed6[0].deleted);
     if (removed6[0].deleted) expect(removed6[0].deleted.key).toBe(6);
-    expect(treeMultimap.delete(6, undefined, true).length).toBe(0);
-    expect(treeMultimap.isAVLBalanced()).toBe(false);
+    expect(tmm.delete(6, undefined, true).length).toBe(0);
+    expect(tmm.isAVLBalanced()).toBe(false);
 
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed7 = treeMultimap.delete(7, undefined, true);
+    const removed7 = tmm.delete(7, undefined, true);
     expect(removed7 instanceof Array);
     expect(removed7[0]);
     expect(removed7[0].deleted);
     if (removed7[0].deleted) expect(removed7[0].deleted.key).toBe(7);
-    expect(treeMultimap.isAVLBalanced()).toBe(false);
-    expect(treeMultimap.getHeight()).toBe(4);
+    expect(tmm.isAVLBalanced()).toBe(false);
+    expect(tmm.getHeight()).toBe(3);
 
-    const removed9 = treeMultimap.delete(9, undefined, true);
+    const removed9 = tmm.delete(9, undefined, true);
     expect(removed9 instanceof Array);
     expect(removed9[0]);
     expect(removed9[0].deleted);
     if (removed9[0].deleted) expect(removed9[0].deleted.key).toBe(9);
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(3);
+    expect(tmm.isAVLBalanced()).toBe(true);
+    expect(tmm.getHeight()).toBe(2);
 
-    const removed14 = treeMultimap.delete(14, undefined, true);
+    const removed14 = tmm.delete(14, undefined, true);
     expect(removed14 instanceof Array);
     expect(removed14[0]);
     expect(removed14[0].deleted);
     if (removed14[0].deleted) expect(removed14[0].deleted.key).toBe(14);
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
-    expect(treeMultimap.getHeight()).toBe(2);
+    expect(tmm.isAVLBalanced()).toBe(true);
+    expect(tmm.getHeight()).toBe(1);
 
-    expect(treeMultimap.isAVLBalanced()).toBe(true);
+    expect(tmm.isAVLBalanced()).toBe(true);
 
-    const bfsIDs = treeMultimap.bfs(node => node.key);
+    const bfsIDs = tmm.bfs(node => node.key);
 
     expect(bfsIDs[0]).toBe(12);
     expect(bfsIDs[1]).toBe(2);
     expect(bfsIDs[2]).toBe(16);
 
-    const bfsNodes = treeMultimap.bfs(node => node);
+    const bfsNodes = tmm.bfs(node => node);
 
     expect(bfsNodes[0].key).toBe(12);
     expect(bfsNodes[1].key).toBe(2);
     expect(bfsNodes[2].key).toBe(16);
 
-    expect(treeMultimap.count).toBe(8);
+    expect(tmm.count).toBe(6);
+    expect(tmm.getMutableCount()).toBe(8);
   });
 
   it('should perform various operations on a Binary Search Tree with object values', () => {
@@ -549,74 +611,142 @@ describe('TreeMultiMap operations test recursively1', () => {
 
     expect(objTreeMultiMap.root).toBeInstanceOf(TreeMultiMapNode);
 
-    if (objTreeMultiMap.root) expect(objTreeMultiMap.root.key).toBe(11);
+    if (objTreeMultiMap.root) expect(objTreeMultiMap.root.key).toBe(5);
 
     expect(objTreeMultiMap.count).toBe(16);
+    expect(objTreeMultiMap.getMutableCount()).toBe(16);
 
     expect(objTreeMultiMap.has(6)).toBe(true);
   });
 });
 
-describe('TreeMultiMap Performance test', function () {
-  const treeMS = new TreeMultiMap<number, number>();
+describe('TreeMultiMap delete test', function () {
+  const tmm = new TreeMultiMap<number, number>();
   const inputSize = 1000; // Adjust input sizes as needed
 
   beforeEach(() => {
-    treeMS.clear();
+    tmm.clear();
   });
 
   it(`Observe the time consumption of TreeMultiMap.dfs be good`, function () {
     const startDFS = performance.now();
-    const dfs = treeMS.dfs(node => node);
+    const dfs = tmm.dfs(node => node);
     isDebug && console.log('---bfs', performance.now() - startDFS, dfs.length);
   });
 
-  it('Should the time consumption of lesserOrGreaterTraverse fitting O(n log n)', function () {
-    const start = performance.now();
+  it('The structure remains normal after random deletion', function () {
+    for (let i = 0; i < inputSize; i++) {
+      tmm.add(i);
+    }
+
+    expect(tmm.size).toBe(inputSize);
+
+    for (let i = 0; i < inputSize; i++) {
+      const num = getRandomInt(0, inputSize - 1);
+      tmm.delete(num);
+    }
+
+    let nilCount = 0;
+    const dfs = (cur: TreeMultiMapNode<number>) => {
+      if (isNaN(cur.key)) nilCount++;
+      if (cur.left) dfs(cur.left);
+      if (cur.right) dfs(cur.right);
+    };
+    if (tmm.root) dfs(tmm.root);
+
+    expect(tmm.size).toBeLessThanOrEqual(inputSize);
+    expect(tmm.getHeight()).toBeGreaterThan(Math.log2(inputSize) - 1);
+    expect(tmm.getHeight()).toBeLessThan(Math.log2(inputSize) * 2);
+
+    expect(nilCount).toBe(tmm.size + 1);
+  });
+
+  it(`Random additions, complete deletions of structures are normal`, function () {
     for (let i = 0; i < inputSize; i++) {
-      treeMS.add(i);
+      const num = getRandomInt(0, inputSize - 1);
+      if (i === 0 && isDebug) console.log(`first:`, num);
+      tmm.add(num);
     }
 
-    isDebug && console.log('---add', performance.now() - start);
-    const startL = performance.now();
-    treeMS.lesserOrGreaterTraverse(node => (node.count += 1), CP.lt, inputSize / 2);
-    isDebug && console.log('---lesserOrGreaterTraverse', performance.now() - startL);
+    for (let i = 0; i < inputSize; i++) {
+      tmm.delete(i, undefined, true);
+    }
+
+    let nilCount = 0;
+    const dfs = (cur: TreeMultiMapNode<number>) => {
+      if (isNaN(cur.key)) nilCount++;
+      if (cur.left) dfs(cur.left);
+      if (cur.right) dfs(cur.right);
+    };
+    if (tmm.root) dfs(tmm.root);
+
+    expect(tmm.size).toBe(0);
+    expect(tmm.getHeight()).toBe(-1);
+    expect(nilCount).toBe(tmm.size + 1);
+
+    isDebug && tmm.print();
+  });
+
+  it(`Random additions, count deletions of structures are normal`, function () {
+    for (let i = 0; i < inputSize; i++) {
+      const num = getRandomInt(0, inputSize - 1);
+      if (i === 0 && isDebug) console.log(`first:`, num);
+      tmm.add(num);
+    }
+
+    for (let i = 0; i < inputSize; i++) {
+      tmm.delete(i);
+    }
+
+    let nanCount = 0;
+    const dfs = (cur: TreeMultiMapNode<number>) => {
+      if (isNaN(cur.key)) nanCount++;
+      if (cur.left) dfs(cur.left);
+      if (cur.right) dfs(cur.right);
+    };
+    if (tmm.root) dfs(tmm.root);
+
+    expect(tmm.size).toBeGreaterThanOrEqual(0);
+    expect(tmm.getHeight()).toBeGreaterThanOrEqual(0);
+    expect(nanCount).toBeLessThanOrEqual(inputSize);
+
+    isDebug && tmm.print();
   });
 
   it('should the clone method', () => {
-    function checkTreeStructure(treeMultimap: TreeMultiMap<string, number>) {
-      expect(treeMultimap.size).toBe(4);
-      expect(treeMultimap.root?.key).toBe('4');
-      expect(treeMultimap.root?.left?.key).toBe('1');
-      expect(treeMultimap.root?.left?.left?.key).toBe(NaN);
-      expect(treeMultimap.root?.left?.right?.key).toBe('2');
-      expect(treeMultimap.root?.right?.key).toBe('5');
-      expect(treeMultimap.root?.right?.left?.key).toBe(NaN);
-      expect(treeMultimap.root?.right?.right?.key).toBe(NaN);
+    function checkTreeStructure(tmm: TreeMultiMap<string, number>) {
+      expect(tmm.size).toBe(4);
+      expect(tmm.root?.key).toBe('2');
+      expect(tmm.root?.left?.key).toBe('1');
+      expect(tmm.root?.left?.left?.key).toBe(NaN);
+      expect(tmm.root?.left?.right?.key).toBe(NaN);
+      expect(tmm.root?.right?.key).toBe('4');
+      expect(tmm.root?.right?.left?.key).toBe(NaN);
+      expect(tmm.root?.right?.right?.key).toBe('5');
     }
 
-    const treeMultimap = new TreeMultiMap<string, number>();
-    treeMultimap.addMany([
+    const tmm = new TreeMultiMap<string, number>();
+    tmm.addMany([
       ['2', 2],
       ['4', 4],
       ['5', 5],
       ['3', 3],
       ['1', 1]
     ]);
-    expect(treeMultimap.size).toBe(5);
-    expect(treeMultimap.root?.key).toBe('3');
-    expect(treeMultimap.root?.left?.key).toBe('1');
-    expect(treeMultimap.root?.left?.left?.key).toBe(NaN);
-    expect(treeMultimap.root?.left?.right?.key).toBe('2');
-    expect(treeMultimap.root?.right?.key).toBe('4');
-    expect(treeMultimap.root?.right?.left?.key).toBe(NaN);
-    expect(treeMultimap.root?.right?.right?.key).toBe('5');
-    treeMultimap.delete('3');
-    checkTreeStructure(treeMultimap);
-    const cloned = treeMultimap.clone();
+    expect(tmm.size).toBe(5);
+    expect(tmm.root?.key).toBe('2');
+    expect(tmm.root?.left?.key).toBe('1');
+    expect(tmm.root?.left?.left?.key).toBe(NaN);
+    expect(tmm.root?.left?.right?.key).toBe(NaN);
+    expect(tmm.root?.right?.key).toBe('4');
+    expect(tmm.root?.right?.left?.key).toBe(`3`);
+    expect(tmm.root?.right?.right?.key).toBe('5');
+    tmm.delete('3');
+    checkTreeStructure(tmm);
+    const cloned = tmm.clone();
     checkTreeStructure(cloned);
     cloned.delete('1');
-    expect(treeMultimap.size).toBe(4);
+    expect(tmm.size).toBe(4);
     expect(cloned.size).toBe(3);
   });
 });
@@ -689,9 +819,10 @@ describe('TreeMultiMap iterative methods test', () => {
 
   test('should clone work well', () => {
     expect(treeMM.count).toBe(21);
+    expect(treeMM.getMutableCount()).toBe(21);
     const cloned = treeMM.clone();
-    expect(cloned.root?.left?.key).toBe(NaN);
-    expect(cloned.root?.right?.value).toBe('b');
+    expect(cloned.root?.left?.key).toBe(1);
+    expect(cloned.root?.right?.value).toBe('c');
   });
 
   test('should keys', () => {