avl-tree-typed 1.52.5 → 1.52.8

package/dist/data-structures/linked-list/doubly-linked-list.js

@@ -242,7 +242,7 @@ class DoublyLinkedList extends base_1.IterableElementBase {
      * or the linked list is empty, it will return undefined.
      */
     at(index) {
-        if (index < 0 || index >= this.size)
+        if (index < 0 || index >= this._size)
             return undefined;
         let current = this.head;
         for (let i = 0; i < index; i++) {
@@ -262,7 +262,7 @@ class DoublyLinkedList extends base_1.IterableElementBase {
      * valid range of the linked list, otherwise it returns `undefined`.
      */
     getNodeAt(index) {
-        if (index < 0 || index >= this.size)
+        if (index < 0 || index >= this._size)
             return undefined;
         let current = this.head;
         for (let i = 0; i < index; i++) {
@@ -303,13 +303,13 @@ class DoublyLinkedList extends base_1.IterableElementBase {
      * if the index is out of bounds.
      */
     addAt(index, value) {
-        if (index < 0 || index > this.size)
+        if (index < 0 || index > this._size)
             return false;
         if (index === 0) {
             this.unshift(value);
             return true;
         }
-        if (index === this.size) {
+        if (index === this._size) {
             this.push(value);
             return true;
         }
@@ -407,13 +407,13 @@ class DoublyLinkedList extends base_1.IterableElementBase {
      * bounds.
      */
     deleteAt(index) {
-        if (index < 0 || index >= this.size)
+        if (index < 0 || index >= this._size)
             return false;
         if (index === 0) {
             this.shift();
             return true;
         }
-        if (index === this.size - 1) {
+        if (index === this._size - 1) {
             this.pop();
             return true;
         }
@@ -469,7 +469,7 @@ class DoublyLinkedList extends base_1.IterableElementBase {
      * @returns A boolean value is being returned.
      */
     isEmpty() {
-        return this.size === 0;
+        return this._size === 0;
     }
     /**
      * Time Complexity: O(1)

package/dist/data-structures/linked-list/singly-linked-list.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { ElementCallback, SinglyLinkedListOptions } from '../../types';

package/dist/data-structures/linked-list/singly-linked-list.js

@@ -213,7 +213,7 @@ class SinglyLinkedList extends base_1.IterableElementBase {
      * `undefined` if the index is out of bounds.
      */
     at(index) {
-        if (index < 0 || index >= this.size)
+        if (index < 0 || index >= this._size)
             return undefined;
         let current = this.head;
         for (let i = 0; i < index; i++) {
@@ -249,13 +249,13 @@ class SinglyLinkedList extends base_1.IterableElementBase {
      * bounds.
      */
     deleteAt(index) {
-        if (index < 0 || index >= this.size)
+        if (index < 0 || index >= this._size)
             return false;
         if (index === 0) {
             this.shift();
             return true;
         }
-        if (index === this.size - 1) {
+        if (index === this._size - 1) {
             this.pop();
             return true;
         }
@@ -321,13 +321,13 @@ class SinglyLinkedList extends base_1.IterableElementBase {
      * if the index is out of bounds.
      */
     addAt(index, value) {
-        if (index < 0 || index > this.size)
+        if (index < 0 || index > this._size)
             return false;
         if (index === 0) {
             this.unshift(value);
             return true;
         }
-        if (index === this.size) {
+        if (index === this._size) {
             this.push(value);
             return true;
         }
@@ -344,7 +344,7 @@ class SinglyLinkedList extends base_1.IterableElementBase {
      * @returns A boolean value indicating whether the length of the object is equal to 0.
      */
     isEmpty() {
-        return this.size === 0;
+        return this._size === 0;
     }
     /**
      * The `clear` function resets the linked list by setting the head, tail, and length to undefined and 0 respectively.

package/dist/data-structures/linked-list/skip-linked-list.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { SkipLinkedListOptions } from '../../types';

package/dist/data-structures/matrix/matrix.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { MatrixOptions } from '../../types';

package/dist/data-structures/matrix/navigator.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { Direction, NavigatorParams, Turning } from '../../types';

package/dist/data-structures/matrix/navigator.js

@@ -27,7 +27,8 @@ class Navigator {
         this._cur = cur;
         this._character = new Character(charDir, turning);
         this.onMove = onMove;
-        this.onMove && this.onMove(this._cur);
+        if (this.onMove)
+            this.onMove(this._cur);
         this._VISITED = VISITED;
         this._matrix[this._cur[0]][this._cur[1]] = this._VISITED;
     }
@@ -100,7 +101,8 @@ class Navigator {
         }
         const [i, j] = this._cur;
         this._matrix[i][j] = this._VISITED;
-        this.onMove && this.onMove(this._cur);
+        if (this.onMove)
+            this.onMove(this._cur);
     }
 }
 exports.Navigator = Navigator;

package/dist/data-structures/queue/deque.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { DequeOptions, ElementCallback, IterableWithSizeOrLength } from '../../types';
@@ -287,7 +287,7 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * The `shrinkToFit` function reorganizes the elements in an array-like data structure to minimize
      * memory usage.
      * @returns Nothing is being returned. The function is using the `return` statement to exit early if
-     * `this.size` is 0, but it does not return any value.
+     * `this._size` is 0, but it does not return any value.
      */
     shrinkToFit(): void;
     /**

package/dist/data-structures/queue/deque.js

@@ -142,7 +142,7 @@ class Deque extends base_1.IterableElementBase {
      * @returns The first element of the collection, of type E, is being returned.
      */
     get first() {
-        if (this.size === 0)
+        if (this._size === 0)
             return;
         return this._buckets[this._bucketFirst][this._firstInBucket];
     }
@@ -151,7 +151,7 @@ class Deque extends base_1.IterableElementBase {
      * @return The last element in the array
      */
     get last() {
-        if (this.size === 0)
+        if (this._size === 0)
             return;
         return this._buckets[this._bucketLast][this._lastInBucket];
     }
@@ -165,7 +165,7 @@ class Deque extends base_1.IterableElementBase {
      * @returns The size of the data structure after the element has been pushed.
      */
     push(element) {
-        if (this.size) {
+        if (this._size) {
             if (this._lastInBucket < this._bucketSize - 1) {
                 this._lastInBucket += 1;
             }
@@ -195,10 +195,10 @@ class Deque extends base_1.IterableElementBase {
      * @returns The element that was removed from the data structure is being returned.
      */
     pop() {
-        if (this.size === 0)
+        if (this._size === 0)
             return;
         const element = this._buckets[this._bucketLast][this._lastInBucket];
-        if (this.size !== 1) {
+        if (this._size !== 1) {
             if (this._lastInBucket > 0) {
                 this._lastInBucket -= 1;
             }
@@ -225,7 +225,7 @@ class Deque extends base_1.IterableElementBase {
      * @returns The size of the data structure after the element has been added.
      */
     unshift(element) {
-        if (this.size) {
+        if (this._size) {
             if (this._firstInBucket > 0) {
                 this._firstInBucket -= 1;
             }
@@ -256,10 +256,10 @@ class Deque extends base_1.IterableElementBase {
      * returned.
      */
     shift() {
-        if (this.size === 0)
+        if (this._size === 0)
             return;
         const element = this._buckets[this._bucketFirst][this._firstInBucket];
-        if (this.size !== 1) {
+        if (this._size !== 1) {
             if (this._firstInBucket < this._bucketSize - 1) {
                 this._firstInBucket += 1;
             }
@@ -283,7 +283,7 @@ class Deque extends base_1.IterableElementBase {
      * @returns A boolean value indicating whether the size of the object is 0 or not.
      */
     isEmpty() {
-        return this.size === 0;
+        return this._size === 0;
     }
     /**
      * Time Complexity: O(1)
@@ -303,7 +303,7 @@ class Deque extends base_1.IterableElementBase {
      */
     *begin() {
         let index = 0;
-        while (index < this.size) {
+        while (index < this._size) {
             yield this.at(index);
             index++;
         }
@@ -313,7 +313,7 @@ class Deque extends base_1.IterableElementBase {
      * the last element.
      */
     *reverseBegin() {
-        let index = this.size - 1;
+        let index = this._size - 1;
         while (index >= 0) {
             yield this.at(index);
             index--;
@@ -330,7 +330,7 @@ class Deque extends base_1.IterableElementBase {
      * @returns The element at the specified position in the data structure is being returned.
      */
     at(pos) {
-        (0, utils_1.rangeCheck)(pos, 0, this.size - 1);
+        (0, utils_1.rangeCheck)(pos, 0, this._size - 1);
         const { bucketIndex, indexInBucket } = this._getBucketAndPosition(pos);
         return this._buckets[bucketIndex][indexInBucket];
     }
@@ -345,7 +345,7 @@ class Deque extends base_1.IterableElementBase {
      * position in the data structure.
      */
     setAt(pos, element) {
-        (0, utils_1.rangeCheck)(pos, 0, this.size - 1);
+        (0, utils_1.rangeCheck)(pos, 0, this._size - 1);
         const { bucketIndex, indexInBucket } = this._getBucketAndPosition(pos);
         this._buckets[bucketIndex][indexInBucket] = element;
         return true;
@@ -366,19 +366,19 @@ class Deque extends base_1.IterableElementBase {
      * @returns The size of the array after the insertion is being returned.
      */
     addAt(pos, element, num = 1) {
-        const length = this.size;
+        const length = this._size;
         (0, utils_1.rangeCheck)(pos, 0, length);
         if (pos === 0) {
             while (num--)
                 this.unshift(element);
         }
-        else if (pos === this.size) {
+        else if (pos === this._size) {
             while (num--)
                 this.push(element);
         }
         else {
             const arr = [];
-            for (let i = pos; i < this.size; ++i) {
+            for (let i = pos; i < this._size; ++i) {
                 arr.push(this.at(i));
             }
             this.cut(pos - 1, true);
@@ -450,7 +450,7 @@ class Deque extends base_1.IterableElementBase {
             const newDeque = new Deque([], { bucketSize: this._bucketSize });
             if (pos < 0)
                 pos = 0;
-            for (let i = pos; i < this.size; i++) {
+            for (let i = pos; i < this._size; i++) {
                 newDeque.push(this.at(i));
             }
             return newDeque;
@@ -468,13 +468,13 @@ class Deque extends base_1.IterableElementBase {
      * @returns The size of the data structure after the deletion operation is performed.
      */
     deleteAt(pos) {
-        (0, utils_1.rangeCheck)(pos, 0, this.size - 1);
+        (0, utils_1.rangeCheck)(pos, 0, this._size - 1);
         if (pos === 0)
             this.shift();
-        else if (pos === this.size - 1)
+        else if (pos === this._size - 1)
             this.pop();
         else {
-            const length = this.size - 1;
+            const length = this._size - 1;
             let { bucketIndex: curBucket, indexInBucket: curPointer } = this._getBucketAndPosition(pos);
             for (let i = pos; i < length; ++i) {
                 const { bucketIndex: nextBucket, indexInBucket: nextPointer } = this._getBucketAndPosition(pos + 1);
@@ -497,7 +497,7 @@ class Deque extends base_1.IterableElementBase {
      * @returns The size of the data structure after the element has been deleted.
      */
     delete(element) {
-        const size = this.size;
+        const size = this._size;
         if (size === 0)
             return false;
         let i = 0;
@@ -542,12 +542,12 @@ class Deque extends base_1.IterableElementBase {
      * @returns The size of the modified array is being returned.
      */
     unique() {
-        if (this.size <= 1) {
+        if (this._size <= 1) {
             return this;
         }
         let index = 1;
         let prev = this.at(0);
-        for (let i = 1; i < this.size; ++i) {
+        for (let i = 1; i < this._size; ++i) {
             const cur = this.at(i);
             if (cur !== prev) {
                 prev = cur;
@@ -569,11 +569,11 @@ class Deque extends base_1.IterableElementBase {
      */
     sort(comparator) {
         const arr = [];
-        for (let i = 0; i < this.size; ++i) {
+        for (let i = 0; i < this._size; ++i) {
             arr.push(this.at(i));
         }
         arr.sort(comparator);
-        for (let i = 0; i < this.size; ++i) {
+        for (let i = 0; i < this._size; ++i) {
             this.setAt(i, arr[i]);
         }
         return this;
@@ -585,10 +585,10 @@ class Deque extends base_1.IterableElementBase {
      * The `shrinkToFit` function reorganizes the elements in an array-like data structure to minimize
      * memory usage.
      * @returns Nothing is being returned. The function is using the `return` statement to exit early if
-     * `this.size` is 0, but it does not return any value.
+     * `this._size` is 0, but it does not return any value.
      */
     shrinkToFit() {
-        if (this.size === 0)
+        if (this._size === 0)
             return;
         const newBuckets = [];
         if (this._bucketFirst === this._bucketLast)
@@ -622,7 +622,7 @@ class Deque extends base_1.IterableElementBase {
      * in the data structure. If the element is not found, it returns -1.
      */
     indexOf(element) {
-        for (let i = 0; i < this.size; ++i) {
+        for (let i = 0; i < this._size; ++i) {
             if (this.at(i) === element) {
                 return i;
             }
@@ -713,7 +713,7 @@ class Deque extends base_1.IterableElementBase {
      * object to be iterated over using a for...of loop.
      */
     *_getIterator() {
-        for (let i = 0; i < this.size; ++i) {
+        for (let i = 0; i < this._size; ++i) {
             yield this.at(i);
         }
     }

package/dist/data-structures/queue/queue.d.ts

@@ -1,6 +1,6 @@
 /**
  * @license MIT
- * @copyright Tyler Zeng <zrwusa@gmail.com>
+ * @copyright Pablo Zeng <zrwusa@gmail.com>
  * @class
  */
 import type { ElementCallback, QueueOptions } from '../../types';

package/dist/data-structures/stack/stack.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { ElementCallback, StackOptions } from '../../types';

package/dist/data-structures/trie/trie.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { ElementCallback, TrieOptions } from '../../types';

package/dist/data-structures/trie/trie.js

@@ -178,7 +178,7 @@ class Trie extends base_1.IterableElementBase {
      * @return True if the size of the queue is 0
      */
     isEmpty() {
-        return this.size === 0;
+        return this._size === 0;
     }
     /**
      * Time Complexity: O(1)

package/dist/index.d.ts

@@ -12,3 +12,4 @@ export * from './types/data-structures/binary-tree/avl-tree';
 export * from './types/data-structures/binary-tree/bst';
 export * from './types/data-structures/binary-tree/binary-tree';
 export * from './types/common';
+export * from './constants';

package/dist/index.js

@@ -28,3 +28,4 @@ __exportStar(require("./types/data-structures/binary-tree/avl-tree"), exports);
 __exportStar(require("./types/data-structures/binary-tree/bst"), exports);
 __exportStar(require("./types/data-structures/binary-tree/binary-tree"), exports);
 __exportStar(require("./types/common"), exports);
+__exportStar(require("./constants"), exports);

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

@@ -1,9 +1,9 @@
 import { BinaryTree, BinaryTreeNode } from '../data-structures';
-import type { BinaryTreeDeleteResult, BinaryTreeNested, BinaryTreeNodeNested, BinaryTreeOptions, BTNCallback, BTNKeyOrNodeOrEntry } from '../types';
+import type { BinaryTreeDeleteResult, BinaryTreeNested, BinaryTreeNodeNested, BinaryTreeOptions, BTNKeyOrNodeOrEntry, BTNPredicate } from '../types';
 export interface IBinaryTree<K = any, V = any, R = [K, V], NODE extends BinaryTreeNode<K, V, NODE> = BinaryTreeNodeNested<K, V>, TREE extends BinaryTree<K, V, R, NODE, TREE> = BinaryTreeNested<K, V, R, NODE>> {
     createNode(key: K, value?: NODE['value']): NODE;
     createTree(options?: Partial<BinaryTreeOptions<K, V, R>>): TREE;
     add(keyOrNodeOrEntryOrRawElement: BTNKeyOrNodeOrEntry<K, V, NODE>, value?: V, count?: number): boolean;
     addMany(nodes: Iterable<BTNKeyOrNodeOrEntry<K, V, NODE>>, values?: Iterable<V | undefined>): boolean[];
-    delete<C extends BTNCallback<NODE>>(identifier: ReturnType<C> | null, callback: C): BinaryTreeDeleteResult<NODE>[];
+    delete(predicate: R | BTNKeyOrNodeOrEntry<K, V, NODE> | BTNPredicate<NODE>): BinaryTreeDeleteResult<NODE>[];
 }

package/dist/types/data-structures/binary-tree/binary-tree.d.ts

@@ -1,5 +1,6 @@
 import { BinaryTree, BinaryTreeNode } from '../../../data-structures';
 import { IterationType, OptValue } from '../../common';
+import { DFSOperation } from '../../../constants';
 export type BinaryTreeNodeNested<K, V> = BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BinaryTreeNested<K, V, R, NODE extends BinaryTreeNode<K, V, NODE>> = BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BinaryTreeOptions<K, V, R> = {
@@ -23,10 +24,7 @@ export type BinaryTreeDeleteResult<NODE> = {
     needBalanced: OptBTNOrNull<NODE>;
 };
 export type BTNCallback<NODE, D = any> = (node: NODE) => D;
-export declare enum DFSOperation {
-    VISIT = 0,
-    PROCESS = 1
-}
+export type BTNPredicate<NODE> = (node: NODE) => boolean;
 export type DFSStackItem<NODE> = {
     opt: DFSOperation;
     node: OptBTNOrNull<NODE>;

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

@@ -1,8 +1,2 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.DFSOperation = void 0;
-var DFSOperation;
-(function (DFSOperation) {
-    DFSOperation[DFSOperation["VISIT"] = 0] = "VISIT";
-    DFSOperation[DFSOperation["PROCESS"] = 1] = "PROCESS";
-})(DFSOperation = exports.DFSOperation || (exports.DFSOperation = {}));

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "avl-tree-typed",
-  "version": "1.52.5",
+  "version": "1.52.8",
   "description": "AVLTree(Adelson-Velsky and Landis Tree). Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -163,6 +163,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.52.5"
+    "data-structure-typed": "^1.52.8"
   }
 }

package/src/constants/index.ts

@@ -0,0 +1,4 @@
+export enum DFSOperation {
+  VISIT = 0,
+  PROCESS = 1
+}

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

@@ -192,10 +192,20 @@ export abstract class IterableElementBase<E, R, C> {
    *
    * The print function logs the elements of an array to the console.
    */
-  print(): E[] {
+  toVisual(): E[] {
     return [...this];
   }
 
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(n)
+   *
+   * The print function logs the elements of an array to the console.
+   */
+  print(): void {
+    console.log(this.toVisual());
+  }
+
   abstract isEmpty(): boolean;
 
   abstract clear(): void;

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

@@ -1,26 +1,8 @@
 import { EntryCallback, ReduceEntryCallback } from '../../types';
 
 export abstract class IterableEntryBase<K = any, V = any> {
-  // protected constructor(options?: IterableEntryBaseOptions<K, V, R>) {
-  //   if (options) {
-  //     const { toEntryFn } = options;
-  //     if (typeof toEntryFn === 'function') this._toEntryFn = toEntryFn
-  //     else throw new TypeError('toEntryFn must be a function type');
-  //   }
-  // }
-
   abstract get size(): number;
 
-  // protected _toEntryFn?: (rawElement: R) => BTNEntry<K, V>;
-  //
-  // /**
-  //  * The function returns the value of the _toEntryFn property.
-  //  * @returns The function being returned is `this._toEntryFn`.
-  //  */
-  // get toEntryFn() {
-  //   return this._toEntryFn;
-  // }
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -251,10 +233,20 @@ export abstract class IterableEntryBase<K = any, V = any> {
    *
    * The print function logs the elements of an array to the console.
    */
-  print(): [K, V][] | string {
+  toVisual(): [K, V][] | string {
     return [...this];
   }
 
+  /**
+   * Time Complexity: O(n)
+   * Space Complexity: O(n)
+   *
+   * The print function logs the elements of an array to the console.
+   */
+  print(): void {
+    console.log(this.toVisual());
+  }
+
   abstract isEmpty(): boolean;
 
   abstract clear(): void;