priority-queue-typed 1.48.3 → 1.48.5

package/dist/data-structures/graph/undirected-graph.js

@@ -36,20 +36,20 @@ class UndirectedEdge extends abstract_graph_1.AbstractEdge {
      */
     constructor(v1, v2, weight, value) {
         super(weight, value);
-        this.vertices = [v1, v2];
+        this.vertexMap = [v1, v2];
     }
 }
 exports.UndirectedEdge = UndirectedEdge;
 class UndirectedGraph extends abstract_graph_1.AbstractGraph {
     /**
-     * The constructor initializes a new Map object to store edges.
+     * The constructor initializes a new Map object to store edgeMap.
      */
     constructor() {
         super();
-        this._edges = new Map();
+        this._edgeMap = new Map();
     }
-    get edges() {
-        return this._edges;
+    get edgeMap() {
+        return this._edgeMap;
     }
     /**
      * The function creates a new vertex with an optional value and returns it.
@@ -64,7 +64,7 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         return new UndirectedVertex(key, value !== null && value !== void 0 ? value : key);
     }
     /**
-     * The function creates an undirected edge between two vertices with an optional weight and value.
+     * The function creates an undirected edge between two vertexMap with an optional weight and value.
      * @param {VertexKey} v1 - The parameter `v1` represents the first vertex of the edge.
      * @param {VertexKey} v2 - The parameter `v2` represents the second vertex of the edge.
      * @param {number} [weight] - The `weight` parameter is an optional number that represents the weight of the edge. If
@@ -77,14 +77,14 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         return new UndirectedEdge(v1, v2, weight !== null && weight !== void 0 ? weight : 1, value);
     }
     /**
-     * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
+     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
+     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
      *
-     * The function `getEdge` returns the first edge that connects two vertices, or undefined if no such edge exists.
+     * The function `getEdge` returns the first edge that connects two vertexMap, or undefined if no such edge exists.
      * @param {VO | VertexKey | undefined} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `VO` (vertex
      * object), `undefined`, or `VertexKey` (a string or number representing the ID of a vertex).
      * @param {VO | VertexKey | undefined} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `VO` (vertex
@@ -93,29 +93,29 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
      */
     getEdge(v1, v2) {
         var _a;
-        let edges = [];
+        let edgeMap = [];
         if (v1 !== undefined && v2 !== undefined) {
             const vertex1 = this._getVertex(v1);
             const vertex2 = this._getVertex(v2);
             if (vertex1 && vertex2) {
-                edges = (_a = this._edges.get(vertex1)) === null || _a === void 0 ? void 0 : _a.filter(e => e.vertices.includes(vertex2.key));
+                edgeMap = (_a = this._edgeMap.get(vertex1)) === null || _a === void 0 ? void 0 : _a.filter(e => e.vertexMap.includes(vertex2.key));
             }
         }
-        return edges ? edges[0] || undefined : undefined;
+        return edgeMap ? edgeMap[0] || undefined : undefined;
     }
     /**
-     * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
+     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
+     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
      *
-     * The function removes an edge between two vertices in a graph and returns the removed edge.
+     * The function removes an edge between two vertexMap in a graph and returns the removed edge.
      * @param {VO | VertexKey} v1 - The parameter `v1` represents either a vertex object (`VO`) or a vertex ID (`VertexKey`).
      * @param {VO | VertexKey} v2 - VO | VertexKey - This parameter can be either a vertex object (VO) or a vertex ID
      * (VertexKey). It represents the second vertex of the edge that needs to be removed.
-     * @returns the removed edge (EO) if it exists, or undefined if either of the vertices (VO) does not exist.
+     * @returns the removed edge (EO) if it exists, or undefined if either of the vertexMap (VO) does not exist.
      */
     deleteEdgeBetween(v1, v2) {
         const vertex1 = this._getVertex(v1);
@@ -123,31 +123,94 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         if (!vertex1 || !vertex2) {
             return undefined;
         }
-        const v1Edges = this._edges.get(vertex1);
+        const v1Edges = this._edgeMap.get(vertex1);
         let removed = undefined;
         if (v1Edges) {
-            removed = (0, utils_1.arrayRemove)(v1Edges, (e) => e.vertices.includes(vertex2.key))[0] || undefined;
+            removed = (0, utils_1.arrayRemove)(v1Edges, (e) => e.vertexMap.includes(vertex2.key))[0] || undefined;
         }
-        const v2Edges = this._edges.get(vertex2);
+        const v2Edges = this._edgeMap.get(vertex2);
         if (v2Edges) {
-            (0, utils_1.arrayRemove)(v2Edges, (e) => e.vertices.includes(vertex1.key));
+            (0, utils_1.arrayRemove)(v2Edges, (e) => e.vertexMap.includes(vertex1.key));
         }
         return removed;
     }
     /**
-     * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
+     * Time Complexity: O(E), where E is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
+     * Time Complexity: O(E), where E is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
      *
-     * The deleteEdge function removes an edge between two vertices in a graph.
-     * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
-     * @returns The method is returning either the removed edge (of type EO) or undefined if the edge was not found.
+     * The function `deleteEdge` deletes an edge between two vertexMap in a graph.
+     * @param {EO | VertexKey} edgeOrOneSideVertexKey - The parameter `edgeOrOneSideVertexKey` can be
+     * either an edge object or a vertex key.
+     * @param {VertexKey} [otherSideVertexKey] - The parameter `otherSideVertexKey` is an optional
+     * parameter that represents the key of the vertex on the other side of the edge. It is used when the
+     * `edgeOrOneSideVertexKey` parameter is a vertex key, and it specifies the key of the vertex on the
+     * other side of the
+     * @returns The `deleteEdge` function returns either the deleted edge object (EO) or `undefined`.
+     */
+    deleteEdge(edgeOrOneSideVertexKey, otherSideVertexKey) {
+        let oneSide, otherSide;
+        if (this.isVertexKey(edgeOrOneSideVertexKey)) {
+            if (this.isVertexKey(otherSideVertexKey)) {
+                oneSide = this._getVertex(edgeOrOneSideVertexKey);
+                otherSide = this._getVertex(otherSideVertexKey);
+            }
+            else {
+                return;
+            }
+        }
+        else {
+            oneSide = this._getVertex(edgeOrOneSideVertexKey.vertexMap[0]);
+            otherSide = this._getVertex(edgeOrOneSideVertexKey.vertexMap[1]);
+        }
+        if (oneSide && otherSide) {
+            return this.deleteEdgeBetween(oneSide, otherSide);
+        }
+        else {
+            return;
+        }
+    }
+    /**
+     * Time Complexity: O(1) - Constant time for Map operations.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
      */
-    deleteEdge(edge) {
-        return this.deleteEdgeBetween(edge.vertices[0], edge.vertices[1]);
+    /**
+     * Time Complexity: O(1) - Constant time for Map operations.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     *
+     * The `deleteVertex` function removes a vertex from a graph by its ID or by the vertex object itself.
+     * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
+     * (`VertexKey`).
+     * @returns The method is returning a boolean value.
+     */
+    deleteVertex(vertexOrKey) {
+        let vertexKey;
+        let vertex;
+        if (this.isVertexKey(vertexOrKey)) {
+            vertex = this.getVertex(vertexOrKey);
+            vertexKey = vertexOrKey;
+        }
+        else {
+            vertex = vertexOrKey;
+            vertexKey = this._getVertexKey(vertexOrKey);
+        }
+        const neighbors = this.getNeighbors(vertexOrKey);
+        if (vertex) {
+            neighbors.forEach(neighbor => {
+                const neighborEdges = this._edgeMap.get(neighbor);
+                if (neighborEdges) {
+                    const restEdges = neighborEdges.filter(edge => {
+                        return !edge.vertexMap.includes(vertexKey);
+                    });
+                    this._edgeMap.set(neighbor, restEdges);
+                }
+            });
+            this._edgeMap.delete(vertex);
+        }
+        return this._vertexMap.delete(vertexKey);
     }
     /**
      * Time Complexity: O(1)
@@ -157,17 +220,17 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function `degreeOf` returns the degree of a vertex in a graph, which is the number of edges connected to that
+     * The function `degreeOf` returns the degree of a vertex in a graph, which is the number of edgeMap connected to that
      * vertex.
      * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`.
      * @returns The function `degreeOf` returns the degree of a vertex in a graph. The degree of a vertex is the number of
-     * edges connected to that vertex.
+     * edgeMap connected to that vertex.
      */
     degreeOf(vertexOrKey) {
         var _a;
         const vertex = this._getVertex(vertexOrKey);
         if (vertex) {
-            return ((_a = this._edges.get(vertex)) === null || _a === void 0 ? void 0 : _a.length) || 0;
+            return ((_a = this._edgeMap.get(vertex)) === null || _a === void 0 ? void 0 : _a.length) || 0;
         }
         else {
             return 0;
@@ -181,52 +244,52 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function returns the edges of a given vertex or vertex ID.
+     * The function returns the edgeMap of a given vertex or vertex ID.
      * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`. A `VertexKey` is a
      * unique identifier for a vertex in a graph, while `VO` represents the type of the vertex.
-     * @returns an array of edges.
+     * @returns an array of edgeMap.
      */
     edgesOf(vertexOrKey) {
         const vertex = this._getVertex(vertexOrKey);
         if (vertex) {
-            return this._edges.get(vertex) || [];
+            return this._edgeMap.get(vertex) || [];
         }
         else {
             return [];
         }
     }
     /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertices and |E| is the number of edges.
+     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
      */
     /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertices and |E| is the number of edges.
+     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
      *
-     * The function "edgeSet" returns an array of unique edges from a set of edges.
+     * The function "edgeSet" returns an array of unique edgeMap from a set of edgeMap.
      * @returns The method `edgeSet()` returns an array of type `EO[]`.
      */
     edgeSet() {
         const edgeSet = new Set();
-        this._edges.forEach(edges => {
-            edges.forEach(edge => {
+        this._edgeMap.forEach(edgeMap => {
+            edgeMap.forEach(edge => {
                 edgeSet.add(edge);
             });
         });
         return [...edgeSet];
     }
     /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertices and |E| is the number of edges.
+     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
      */
     /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertices and |E| is the number of edges.
+     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
      *
-     * The function "getNeighbors" returns an array of neighboring vertices for a given vertex or vertex ID.
+     * The function "getNeighbors" returns an array of neighboring vertexMap for a given vertex or vertex ID.
      * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
      * (`VertexKey`).
-     * @returns an array of vertices (VO[]).
+     * @returns an array of vertexMap (VO[]).
      */
     getNeighbors(vertexOrKey) {
         const neighbors = [];
@@ -234,7 +297,7 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         if (vertex) {
             const neighborEdges = this.edgesOf(vertex);
             for (const edge of neighborEdges) {
-                const neighbor = this._getVertex(edge.vertices.filter(e => e !== vertex.key)[0]);
+                const neighbor = this._getVertex(edge.vertexMap.filter(e => e !== vertex.key)[0]);
                 if (neighbor) {
                     neighbors.push(neighbor);
                 }
@@ -250,18 +313,18 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function "getEndsOfEdge" returns the vertices at the ends of an edge if the edge exists in the graph, otherwise
+     * The function "getEndsOfEdge" returns the vertexMap at the ends of an edge if the edge exists in the graph, otherwise
      * it returns undefined.
      * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
-     * @returns The function `getEndsOfEdge` returns an array containing two vertices `[VO, VO]` if the edge exists in the
+     * @returns The function `getEndsOfEdge` returns an array containing two vertexMap `[VO, VO]` if the edge exists in the
      * graph. If the edge does not exist, it returns `undefined`.
      */
     getEndsOfEdge(edge) {
-        if (!this.hasEdge(edge.vertices[0], edge.vertices[1])) {
+        if (!this.hasEdge(edge.vertexMap[0], edge.vertexMap[1])) {
             return undefined;
         }
-        const v1 = this._getVertex(edge.vertices[0]);
-        const v2 = this._getVertex(edge.vertices[1]);
+        const v1 = this._getVertex(edge.vertexMap[0]);
+        const v2 = this._getVertex(edge.vertexMap[1]);
         if (v1 && v2) {
             return [v1, v2];
         }
@@ -277,22 +340,22 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function adds an edge to the graph by updating the adjacency list with the vertices of the edge.
+     * The function adds an edge to the graph by updating the adjacency list with the vertexMap of the edge.
      * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
      * @returns a boolean value.
      */
     _addEdgeOnly(edge) {
-        for (const end of edge.vertices) {
+        for (const end of edge.vertexMap) {
             const endVertex = this._getVertex(end);
             if (endVertex === undefined)
                 return false;
             if (endVertex) {
-                const edges = this._edges.get(endVertex);
-                if (edges) {
-                    edges.push(edge);
+                const edgeMap = this._edgeMap.get(endVertex);
+                if (edgeMap) {
+                    edgeMap.push(edge);
                 }
                 else {
-                    this._edges.set(endVertex, [edge]);
+                    this._edgeMap.set(endVertex, [edge]);
                 }
             }
         }

package/dist/data-structures/hash/hash-map.d.ts

@@ -5,9 +5,9 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import { HashMapLinkedNode, HashMapOptions, HashMapStoreItem, PairCallback } from '../../types';
-import { IterablePairBase } from "../base";
-export declare class HashMap<K = any, V = any> extends IterablePairBase<K, V> {
+import { EntryCallback, HashMapLinkedNode, HashMapOptions, HashMapStoreItem } from '../../types';
+import { IterableEntryBase } from "../base";
+export declare class HashMap<K = any, V = any> extends IterableEntryBase<K, V> {
     protected _store: {
         [key: string]: HashMapStoreItem<K, V>;
     };
@@ -85,7 +85,7 @@ export declare class HashMap<K = any, V = any> extends IterablePairBase<K, V> {
      * @returns The `map` method is returning a new `HashMap` object with the transformed values based on
      * the provided callback function.
      */
-    map<U>(callbackfn: PairCallback<K, V, U>, thisArg?: any): HashMap<K, U>;
+    map<U>(callbackfn: EntryCallback<K, V, U>, thisArg?: any): HashMap<K, U>;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -106,7 +106,7 @@ export declare class HashMap<K = any, V = any> extends IterablePairBase<K, V> {
      * @returns The `filter` method is returning a new `HashMap` object that contains the key-value pairs
      * from the original `HashMap` that pass the provided `predicate` function.
      */
-    filter(predicate: PairCallback<K, V, boolean>, thisArg?: any): HashMap<K, V>;
+    filter(predicate: EntryCallback<K, V, boolean>, thisArg?: any): HashMap<K, V>;
     print(): void;
     /**
      * The function returns an iterator that yields key-value pairs from both an object store and an
@@ -117,7 +117,7 @@ export declare class HashMap<K = any, V = any> extends IterablePairBase<K, V> {
     protected _isObjKey(key: any): key is (object | ((...args: any[]) => any));
     protected _getNoObjKey(key: K): string;
 }
-export declare class LinkedHashMap<K = any, V = any> extends IterablePairBase<K, V> {
+export declare class LinkedHashMap<K = any, V = any> extends IterableEntryBase<K, V> {
     protected _noObjMap: Record<string, HashMapLinkedNode<K, V | undefined>>;
     protected _objMap: WeakMap<object, HashMapLinkedNode<K, V | undefined>>;
     protected _head: HashMapLinkedNode<K, V | undefined>;
@@ -253,7 +253,7 @@ export declare class LinkedHashMap<K = any, V = any> extends IterablePairBase<K,
      * @returns a new `LinkedHashMap` object that contains the key-value pairs from the original
      * `LinkedHashMap` object that satisfy the given predicate function.
      */
-    filter(predicate: PairCallback<K, V, boolean>, thisArg?: any): LinkedHashMap<K, V>;
+    filter(predicate: EntryCallback<K, V, boolean>, thisArg?: any): LinkedHashMap<K, V>;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -275,7 +275,7 @@ export declare class LinkedHashMap<K = any, V = any> extends IterablePairBase<K,
      * @returns a new `LinkedHashMap` object with the values mapped according to the provided callback
      * function.
      */
-    map<NV>(callback: PairCallback<K, V, NV>, thisArg?: any): LinkedHashMap<K, NV>;
+    map<NV>(callback: EntryCallback<K, V, NV>, thisArg?: any): LinkedHashMap<K, NV>;
     print(): void;
     /**
      * Time Complexity: O(n), where n is the number of elements in the LinkedHashMap.

package/dist/data-structures/hash/hash-map.js

@@ -10,7 +10,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.LinkedHashMap = exports.HashMap = void 0;
 const utils_1 = require("../../utils");
 const base_1 = require("../base");
-class HashMap extends base_1.IterablePairBase {
+class HashMap extends base_1.IterableEntryBase {
     /**
      * The constructor function initializes a new instance of a class with optional elements and options.
      * @param elements - The `elements` parameter is an iterable containing key-value pairs `[K, V]`. It
@@ -230,7 +230,7 @@ class HashMap extends base_1.IterablePairBase {
     }
 }
 exports.HashMap = HashMap;
-class LinkedHashMap extends base_1.IterablePairBase {
+class LinkedHashMap extends base_1.IterableEntryBase {
     constructor(elements, options = {
         hashFn: (key) => String(key),
         objHashFn: (key) => key

package/dist/interfaces/binary-tree.d.ts

@@ -3,7 +3,7 @@ import { BinaryTreeNested, BinaryTreeNodeNested, BinaryTreeOptions, BiTreeDelete
 export interface IBinaryTree<K = number, V = any, N extends BinaryTreeNode<K, V, N> = BinaryTreeNodeNested<K, V>, TREE extends BinaryTree<K, V, N, TREE> = BinaryTreeNested<K, V, N>> {
     createNode(key: K, value?: N['value']): N;
     createTree(options?: Partial<BinaryTreeOptions<K>>): TREE;
-    add(keyOrNodeOrEntry: BTNodeExemplar<K, V, N>, count?: number): N | null | undefined;
+    add(keyOrNodeOrEntry: BTNodeExemplar<K, V, N>, value?: V, count?: number): N | null | undefined;
     addMany(nodes: Iterable<BTNodeExemplar<K, V, N>>): (N | null | undefined)[];
     delete<C extends BTNCallback<N>>(identifier: ReturnType<C> | null, callback: C): BiTreeDeleteResult<N>[];
 }

package/dist/types/data-structures/base/base.d.ts

@@ -1,5 +1,5 @@
-import { IterableElementBase, IterablePairBase } from "../../../data-structures";
-export type PairCallback<K, V, R> = (value: V, key: K, index: number, container: IterablePairBase<K, V>) => R;
+import { IterableElementBase, IterableEntryBase } from "../../../data-structures";
+export type EntryCallback<K, V, R> = (value: V, key: K, index: number, container: IterableEntryBase<K, V>) => R;
 export type ElementCallback<V, R> = (element: V, index: number, container: IterableElementBase<V>) => R;
-export type ReducePairCallback<K, V, R> = (accumulator: R, value: V, key: K, index: number, container: IterablePairBase<K, V>) => R;
+export type ReduceEntryCallback<K, V, R> = (accumulator: R, value: V, key: K, index: number, container: IterableEntryBase<K, V>) => R;
 export type ReduceElementCallback<V, R> = (accumulator: R, element: V, index: number, container: IterableElementBase<V>) => R;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "priority-queue-typed",
-  "version": "1.48.3",
+  "version": "1.48.5",
   "description": "Priority Queue, Min Priority Queue, Max Priority Queue. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -120,6 +120,6 @@
     "typedoc": "^0.25.1"
   },
   "dependencies": {
-    "data-structure-typed": "^1.48.3"
+    "data-structure-typed": "^1.48.5"
   }
 }

package/src/data-structures/base/iterable-base.ts

@@ -1,6 +1,6 @@
-import { ElementCallback, PairCallback, ReduceElementCallback, ReducePairCallback } from "../../types";
+import { ElementCallback, EntryCallback, ReduceElementCallback, ReduceEntryCallback } from "../../types";
 
-export abstract class IterablePairBase<K = any, V = any> {
+export abstract class IterableEntryBase<K = any, V = any> {
 
   /**
    * Time Complexity: O(n)
@@ -87,7 +87,7 @@ export abstract class IterablePairBase<K = any, V = any> {
    * @returns The `every` method is returning a boolean value. It returns `true` if every element in
    * the collection satisfies the provided predicate function, and `false` otherwise.
    */
-  every(predicate: PairCallback<K, V, boolean>, thisArg?: any): boolean {
+  every(predicate: EntryCallback<K, V, boolean>, thisArg?: any): boolean {
     let index = 0;
     for (const item of this) {
       if (!predicate.call(thisArg, item[1], item[0], index++, this)) {
@@ -116,7 +116,7 @@ export abstract class IterablePairBase<K = any, V = any> {
    * @returns a boolean value. It returns true if the predicate function returns true for any pair in
    * the collection, and false otherwise.
    */
-  some(predicate: PairCallback<K, V, boolean>, thisArg?: any): boolean {
+  some(predicate: EntryCallback<K, V, boolean>, thisArg?: any): boolean {
     let index = 0;
     for (const item of this) {
       if (predicate.call(thisArg, item[1], item[0], index++, this)) {
@@ -143,7 +143,7 @@ export abstract class IterablePairBase<K = any, V = any> {
    * specify the value of `this` within the callback function. If `thisArg` is provided, it will be
    * used as the `this` value when calling the callback function. If `thisArg` is not provided, `
    */
-  forEach(callbackfn: PairCallback<K, V, void>, thisArg?: any): void {
+  forEach(callbackfn: EntryCallback<K, V, void>, thisArg?: any): void {
     let index = 0;
     for (const item of this) {
       const [key, value] = item;
@@ -171,7 +171,7 @@ export abstract class IterablePairBase<K = any, V = any> {
    * @returns The `reduce` method is returning the final value of the accumulator after iterating over
    * all the elements in the collection.
    */
-  reduce<U>(callbackfn: ReducePairCallback<K, V, U>, initialValue: U): U {
+  reduce<U>(callbackfn: ReduceEntryCallback<K, V, U>, initialValue: U): U {
     let accumulator = initialValue;
     let index = 0;
     for (const item of this) {

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

@@ -95,19 +95,22 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
    * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
    */
 
+
   /**
    * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity.
    * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
-   *
+   * 
    * The function overrides the add method of a binary tree node and balances the tree after inserting
    * a new node.
-   * @param keyOrNodeOrEntry - The parameter `keyOrNodeOrEntry` can be either a key, a node, or an
+   * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be either a key, a node, or an
    * entry.
-   * @returns The method is returning either the inserted node or `undefined`.
+   * @param {V} [value] - The `value` parameter represents the value associated with the key that is
+   * being added to the binary tree.
+   * @returns The method is returning either the inserted node or undefined.
    */
-  override add(keyOrNodeOrEntry: BTNodeExemplar<K, V, N>): N | undefined {
+  override add(keyOrNodeOrEntry: BTNodeExemplar<K, V, N>, value?: V): N | undefined {
     if (keyOrNodeOrEntry === null) return undefined;
-    const inserted = super.add(keyOrNodeOrEntry);
+    const inserted = super.add(keyOrNodeOrEntry, value);
     if (inserted) this._balancePath(inserted);
     return inserted;
   }

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

@@ -19,15 +19,15 @@ import {
   BinaryTreePrintOptions,
   BiTreeDeleteResult,
   DFSOrderPattern,
+  EntryCallback,
   FamilyPosition,
   IterationType,
-  NodeDisplayLayout,
-  PairCallback
+  NodeDisplayLayout
 } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 import { trampoline } from '../../utils';
 import { Queue } from '../queue';
-import { IterablePairBase } from "../base";
+import { IterableEntryBase } from "../base";
 
 /**
  * Represents a node in a binary tree.
@@ -104,7 +104,7 @@ export class BinaryTreeNode<K = any, V = any, N extends BinaryTreeNode<K, V, N>
  * 9. Complete Trees: All levels are fully filled except possibly the last, filled from left to right.
  */
 
-export class BinaryTree<K = any, V = any, N extends BinaryTreeNode<K, V, N> = BinaryTreeNode<K, V, BinaryTreeNodeNested<K, V>>, TREE extends BinaryTree<K, V, N, TREE> = BinaryTree<K, V, N, BinaryTreeNested<K, V, N>>> extends IterablePairBase<K, V | undefined>
+export class BinaryTree<K = any, V = any, N extends BinaryTreeNode<K, V, N> = BinaryTreeNode<K, V, BinaryTreeNodeNested<K, V>>, TREE extends BinaryTree<K, V, N, TREE> = BinaryTree<K, V, N, BinaryTreeNested<K, V, N>>> extends IterableEntryBase<K, V | undefined>
 
   implements IBinaryTree<K, V, N, TREE> {
   iterationType = IterationType.ITERATIVE
@@ -184,13 +184,14 @@ export class BinaryTree<K = any, V = any, N extends BinaryTreeNode<K, V, N> = Bi
   }
 
   /**
-   * The function `exemplarToNode` converts an exemplar of a binary tree node into an actual node
-   * object.
-   * @param exemplar - BTNodeExemplar<K, V,N> - A generic type representing the exemplar parameter of the
-   * function. It can be any type.
-   * @returns a value of type `N` (which represents a node), or `null`, or `undefined`.
+   * The function `exemplarToNode` converts an exemplar object into a node object.
+   * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`.
+   * @param {V} [value] - The `value` parameter is an optional value that can be passed to the
+   * `exemplarToNode` function. It represents the value associated with the exemplar node. If no value
+   * is provided, it will be `undefined`.
+   * @returns a value of type N (node), or null, or undefined.
    */
-  exemplarToNode(exemplar: BTNodeExemplar<K, V, N>): N | null | undefined {
+  exemplarToNode(exemplar: BTNodeExemplar<K, V, N>, value?: V): N | null | undefined {
     if (exemplar === undefined) return;
 
     let node: N | null | undefined;
@@ -208,7 +209,7 @@ export class BinaryTree<K = any, V = any, N extends BinaryTreeNode<K, V, N> = Bi
     } else if (this.isNode(exemplar)) {
       node = exemplar;
     } else if (this.isNotNodeInstance(exemplar)) {
-      node = this.createNode(exemplar);
+      node = this.createNode(exemplar, value);
     } else {
       return;
     }
@@ -230,18 +231,21 @@ export class BinaryTree<K = any, V = any, N extends BinaryTreeNode<K, V, N> = Bi
    * Space Complexity O(1)
    */
 
+
   /**
    * Time Complexity O(log n) - O(n)
    * Space Complexity O(1)
-   *
-   * The `add` function adds a new node to a binary tree, either by key or by providing a node object.
-   * @param keyOrNodeOrEntry - The parameter `keyOrNodeOrEntry` can be one of the following:
-   * @returns The function `add` returns the inserted node (`N`), `null`, or `undefined`.
+   * 
+   * The `add` function adds a new node to a binary tree, either by creating a new node or replacing an
+   * existing node with the same key.
+   * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be one of the following:
+   * @param {V} [value] - The value to be inserted into the binary tree.
+   * @returns The function `add` returns either a node (`N`), `null`, or `undefined`.
    */
-  add(keyOrNodeOrEntry: BTNodeExemplar<K, V, N>): N | null | undefined {
+  add(keyOrNodeOrEntry: BTNodeExemplar<K, V, N>, value?: V): N | null | undefined {
 
     let inserted: N | null | undefined;
-    const newNode = this.exemplarToNode(keyOrNodeOrEntry);
+    const newNode = this.exemplarToNode(keyOrNodeOrEntry, value);
     if (newNode === undefined) return;
 
     const _bfs = (root: N, newNode: N | null): N | undefined | null => {
@@ -1775,7 +1779,7 @@ export class BinaryTree<K = any, V = any, N extends BinaryTreeNode<K, V, N> = Bi
    * @returns The `filter` method is returning a new tree object that contains the key-value pairs that
    * pass the given predicate function.
    */
-  filter(predicate: PairCallback<K, V | undefined, boolean>, thisArg?: any) {
+  filter(predicate: EntryCallback<K, V | undefined, boolean>, thisArg?: any) {
     const newTree = this.createTree();
     let index = 0;
     for (const [key, value] of this) {
@@ -1806,7 +1810,7 @@ export class BinaryTree<K = any, V = any, N extends BinaryTreeNode<K, V, N> = Bi
    * will be used as the `this` value when the callback function is called. If you don't pass a value
    * @returns The `map` method is returning a new tree object.
    */
-  map(callback: PairCallback<K, V | undefined, V>, thisArg?: any) {
+  map(callback: EntryCallback<K, V | undefined, V>, thisArg?: any) {
     const newTree = this.createTree();
     let index = 0;
     for (const [key, value] of this) {