min-heap-typed 1.41.3 → 1.41.4

package/dist/data-structures/binary-tree/binary-tree.js

@@ -142,8 +142,10 @@ class BinaryTree {
             while (queue.size > 0) {
                 const cur = queue.shift();
                 if (cur) {
-                    if (newNode && cur.key === newNode.key)
+                    if (newNode && cur.key === newNode.key) {
+                        cur.value = newNode.value;
                         return;
+                    }
                     const inserted = this._addTo(newNode, cur);
                     if (inserted !== undefined)
                         return inserted;
@@ -170,16 +172,15 @@ class BinaryTree {
         else {
             return;
         }
-        const key = typeof keyOrNode === 'number' ? keyOrNode : keyOrNode ? keyOrNode.key : undefined;
-        const existNode = key !== undefined ? this.getNode(key, (node) => node.key) : undefined;
+        // const key = typeof keyOrNode === 'number' ? keyOrNode : keyOrNode ? keyOrNode.key : undefined;
+        // const existNode = key !== undefined ? this.getNode(key, (node: N) => node.key) : undefined;
         if (this.root) {
-            if (existNode) {
-                existNode.value = value;
-                inserted = existNode;
-            }
-            else {
-                inserted = _bfs(this.root, needInsert);
-            }
+            // if (existNode) {
+            //   existNode.value = value;
+            //   inserted = existNode;
+            // } else {
+            inserted = _bfs(this.root, needInsert);
+            // }
         }
         else {
             this._setRoot(needInsert);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "min-heap-typed",
-  "version": "1.41.3",
+  "version": "1.41.4",
   "description": "Min Heap. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -131,6 +131,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.41.3"
+    "data-structure-typed": "^1.41.4"
   }
 }

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

@@ -179,7 +179,10 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
       while (queue.size > 0) {
         const cur = queue.shift();
         if (cur) {
-          if (newNode && cur.key === newNode.key) return;
+          if (newNode && cur.key === newNode.key) {
+            cur.value = newNode.value;
+            return;
+          }
           const inserted = this._addTo(newNode, cur);
           if (inserted !== undefined) return inserted;
           if (cur.left) queue.push(cur.left);
@@ -201,16 +204,16 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
       return;
     }
 
-    const key = typeof keyOrNode === 'number' ? keyOrNode : keyOrNode ? keyOrNode.key : undefined;
-    const existNode = key !== undefined ? this.getNode(key, (node: N) => node.key) : undefined;
+    // const key = typeof keyOrNode === 'number' ? keyOrNode : keyOrNode ? keyOrNode.key : undefined;
+    // const existNode = key !== undefined ? this.getNode(key, (node: N) => node.key) : undefined;
 
     if (this.root) {
-      if (existNode) {
-        existNode.value = value;
-        inserted = existNode;
-      } else {
-        inserted = _bfs(this.root, needInsert);
-      }
+      // if (existNode) {
+      //   existNode.value = value;
+      //   inserted = existNode;
+      // } else {
+      inserted = _bfs(this.root, needInsert);
+      // }
     } else {
       this._setRoot(needInsert);
       if (needInsert !== null) {