binary-tree-typed 2.5.2 → 2.5.3

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "binary-tree-typed",
-  "version": "2.5.2",
+  "version": "2.5.3",
   "description": "Binary Tree. Javascript & Typescript Data Structure.",
   "browser": "dist/umd/binary-tree-typed.min.js",
   "umd:main": "dist/umd/binary-tree-typed.min.js",
@@ -178,6 +178,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^2.5.2"
+    "data-structure-typed": "^2.5.3"
   }
 }

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

@@ -9,7 +9,6 @@
 import { BST } from './bst';
 import type {
   AVLTreeOptions,
-  BinaryTreeDeleteResult,
   BinaryTreeOptions,
   BSTNOptKeyOrNode,
   EntryCallback,
@@ -475,6 +474,22 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -608,6 +623,18 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -630,15 +657,15 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    */
   override delete(
     keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined
-  ): BinaryTreeDeleteResult<AVLTreeNode<K, V>>[] {
-    const deletedResults = super.delete(keyNodeOrEntry);
+  ): boolean {
+    const deletedResults = this._deleteInternal(keyNodeOrEntry);
     // After deletion, balance the path from the parent of the *physically deleted* node.
     for (const { needBalanced } of deletedResults) {
       if (needBalanced) {
-        this._balancePath(needBalanced);
+        this._balancePath(needBalanced as AVLTreeNode<K, V>);
       }
     }
-    return deletedResults;
+    return deletedResults.length > 0;
   }
 
   /**
@@ -699,6 +726,14 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -838,6 +873,18 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    

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

@@ -109,6 +109,14 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -186,6 +194,14 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -263,6 +279,14 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -340,6 +364,14 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -415,6 +447,14 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -498,6 +538,14 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -555,6 +603,10 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -624,6 +676,10 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+