data-structure-typed 1.42.3 → 1.42.5

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.42.3",
+  "version": "1.42.5",
   "description": "Data Structures of Javascript & TypeScript. Binary Tree, BST, Graph, Heap, Priority Queue, Linked List, Queue, Deque, Stack, AVL Tree, Tree Multiset, Trie, Directed Graph, Undirected Graph, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue.",
   "main": "dist/cjs/src/index.js",
   "module": "dist/mjs/src/index.js",
@@ -30,7 +30,7 @@
     "reformat:test": "npm run lint:test && npm run format:test",
     "reformat": "npm run reformat:src && npm run reformat:test",
     "update:subs": "npm i avl-tree-typed binary-tree-typed bst-typed heap-typed --save-dev",
-    "install:all-subs": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multiset-typed trie-typed undirected-graph-typed queue-typed --save-dev",
+    "install:all-subs": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multimap-typed trie-typed undirected-graph-typed queue-typed --save-dev",
     "test": "jest --runInBand",
     "test:integration": "npm run update:subs && jest --config jest.integration.config.js",
     "benchmark": "ts-node test/performance/reportor.ts",
@@ -161,7 +161,9 @@
     "avl-tree",
     "tree multiset",
     "treemultiset",
-    "tree-multiset",
+    "tree multimap",
+    "treemultimap",
+    "tree-multimap",
     "binary indexed tree",
     "binaryindexedtree",
     "binary-indexed-tree",

package/src/data-structures/binary-tree/avl-tree.ts

@@ -49,13 +49,14 @@ export class AVLTree<V = any, N extends AVLTreeNode<V, N> = AVLTreeNode<V, AVLTr
   /**
    * The function overrides the add method of a binary tree node and balances the tree after inserting
    * a new node.
-   * @param {BTNKey | N | null} keyOrNode - The `keyOrNode` parameter can accept either a
+   * @param {BTNKey | N | undefined} keyOrNode - The `keyOrNode` parameter can accept either a
    * `BTNKey` or a `N` (which represents a node in the binary tree) or `null`.
    * @param [value] - The `value` parameter is the value that you want to assign to the new node that you
    * are adding to the binary search tree.
    * @returns The method is returning the inserted node (`N`), `null`, or `undefined`.
    */
-  override add(keyOrNode: BTNKey | N | null, value?: V): N | null | undefined {
+  override add(keyOrNode: BTNKey | N | null | undefined, value?: V): N | undefined {
+    if (keyOrNode === null) return undefined;
     const inserted = super.add(keyOrNode, value);
     if (inserted) this._balancePath(inserted);
     return inserted;
@@ -226,7 +227,7 @@ export class AVLTree<V = any, N extends AVLTreeNode<V, N> = AVLTreeNode<V, AVLTr
   protected _balanceLR(A: N): void {
     const parentOfA = A.parent;
     const B = A.left;
-    let C = null;
+    let C = undefined;
     if (B) {
       C = B.right;
     }
@@ -309,7 +310,7 @@ export class AVLTree<V = any, N extends AVLTreeNode<V, N> = AVLTreeNode<V, AVLTr
   protected _balanceRL(A: N): void {
     const parentOfA = A.parent;
     const B = A.right;
-    let C = null;
+    let C = undefined;
     if (B) {
       C = B.left;
     }