typescript-ds-lib 0.2.7 → 0.2.9

package/README.md

@@ -1,8 +1,7 @@
 # TypeScript Data Structure Library
 [![NPM](https://img.shields.io/npm/v/typescript-ds-lib?label=npm%20package&color=limegreen)](https://www.npmjs.com/package/typescript-ds-lib)
 
-Native TypeScript data structure implementations without external dependencies.  
-Provides Comparator for custom types. Just pass your own comparator function to the constructor.
+TypeScript data structure implementations without external dependencies. Why to use this library?  
 
 - Fully Tested
 - Fast
@@ -11,11 +10,13 @@ Provides Comparator for custom types. Just pass your own comparator function to
 - Comes with Comparator (for custom types)
 - `hashCode()` and `equals()` are supported
 
+
 ## Install
 ```
 npm install typescript-ds-lib
 ```
 
+
 ## Usage
 ```typescript
 import { Stack } from 'typescript-ds-lib';
@@ -32,6 +33,11 @@ console.log(stack.top());   // 2
 console.log(stack.size());  // 2
 ```
 
+
+## Documentation and Examples
+See the [documentation](https://github.com/baloian/typescript-ds-lib/blob/master/doc/DOCUMENTATION.md) for more details and examples.
+
+
 ## Data Structures
 - Stack
 - Queue
@@ -44,11 +50,9 @@ console.log(stack.size());  // 2
 - Map
 - Hash Table
 - Matrix
+- Graph (coming soon)
 
 
-## Documentation and Examples
-See the [documentation](https://github.com/baloian/typescript-ds-lib/blob/master/doc/DOCUMENTATION.md) for more details and examples.
-
 ## Contributions
 Contributions are welcome and can be made by submitting GitHub pull requests
 to this repository. In general, the source code follows

package/dist/index.d.ts

@@ -1,11 +1,12 @@
 export * from './types';
-export { Stack } from './lib/stack';
-export { Queue } from './lib/queue';
-export { PriorityQueue } from './lib/priority-queue';
 export { BinarySearchTree } from './lib/binary-search-tree';
 export { Deque } from './lib/deque';
+export { HashTable } from './lib/hash-table';
 export { LinkedList } from './lib/linked-list';
-export { Set } from './lib/set';
 export { Map } from './lib/map';
+export { Matrix } from './lib/matrix';
+export { PriorityQueue } from './lib/priority-queue';
+export { Queue } from './lib/queue';
 export { RedBlackTree } from './lib/red-black-tree';
-export { HashTable } from './lib/hash-table';
+export { Set } from './lib/set';
+export { Stack } from './lib/stack';

package/dist/index.js

@@ -14,26 +14,28 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
     for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.HashTable = exports.RedBlackTree = exports.Map = exports.Set = exports.LinkedList = exports.Deque = exports.BinarySearchTree = exports.PriorityQueue = exports.Queue = exports.Stack = void 0;
+exports.Stack = exports.Set = exports.RedBlackTree = exports.Queue = exports.PriorityQueue = exports.Matrix = exports.Map = exports.LinkedList = exports.HashTable = exports.Deque = exports.BinarySearchTree = void 0;
 __exportStar(require("./types"), exports);
-var stack_1 = require("./lib/stack");
-Object.defineProperty(exports, "Stack", { enumerable: true, get: function () { return stack_1.Stack; } });
-var queue_1 = require("./lib/queue");
-Object.defineProperty(exports, "Queue", { enumerable: true, get: function () { return queue_1.Queue; } });
-var priority_queue_1 = require("./lib/priority-queue");
-Object.defineProperty(exports, "PriorityQueue", { enumerable: true, get: function () { return priority_queue_1.PriorityQueue; } });
 var binary_search_tree_1 = require("./lib/binary-search-tree");
 Object.defineProperty(exports, "BinarySearchTree", { enumerable: true, get: function () { return binary_search_tree_1.BinarySearchTree; } });
 var deque_1 = require("./lib/deque");
 Object.defineProperty(exports, "Deque", { enumerable: true, get: function () { return deque_1.Deque; } });
+var hash_table_1 = require("./lib/hash-table");
+Object.defineProperty(exports, "HashTable", { enumerable: true, get: function () { return hash_table_1.HashTable; } });
 var linked_list_1 = require("./lib/linked-list");
 Object.defineProperty(exports, "LinkedList", { enumerable: true, get: function () { return linked_list_1.LinkedList; } });
-var set_1 = require("./lib/set");
-Object.defineProperty(exports, "Set", { enumerable: true, get: function () { return set_1.Set; } });
 var map_1 = require("./lib/map");
 Object.defineProperty(exports, "Map", { enumerable: true, get: function () { return map_1.Map; } });
+var matrix_1 = require("./lib/matrix");
+Object.defineProperty(exports, "Matrix", { enumerable: true, get: function () { return matrix_1.Matrix; } });
+var priority_queue_1 = require("./lib/priority-queue");
+Object.defineProperty(exports, "PriorityQueue", { enumerable: true, get: function () { return priority_queue_1.PriorityQueue; } });
+var queue_1 = require("./lib/queue");
+Object.defineProperty(exports, "Queue", { enumerable: true, get: function () { return queue_1.Queue; } });
 var red_black_tree_1 = require("./lib/red-black-tree");
 Object.defineProperty(exports, "RedBlackTree", { enumerable: true, get: function () { return red_black_tree_1.RedBlackTree; } });
-var hash_table_1 = require("./lib/hash-table");
-Object.defineProperty(exports, "HashTable", { enumerable: true, get: function () { return hash_table_1.HashTable; } });
+var set_1 = require("./lib/set");
+Object.defineProperty(exports, "Set", { enumerable: true, get: function () { return set_1.Set; } });
+var stack_1 = require("./lib/stack");
+Object.defineProperty(exports, "Stack", { enumerable: true, get: function () { return stack_1.Stack; } });
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,qCAAoC;AAA3B,8FAAA,KAAK,OAAA;AACd,qCAAoC;AAA3B,8FAAA,KAAK,OAAA;AACd,uDAAqD;AAA5C,+GAAA,aAAa,OAAA;AACtB,+DAA4D;AAAnD,sHAAA,gBAAgB,OAAA;AACzB,qCAAoC;AAA3B,8FAAA,KAAK,OAAA;AACd,iDAA+C;AAAtC,yGAAA,UAAU,OAAA;AACnB,iCAAgC;AAAvB,0FAAA,GAAG,OAAA;AACZ,iCAAgC;AAAvB,0FAAA,GAAG,OAAA;AACZ,uDAAoD;AAA3C,8GAAA,YAAY,OAAA;AACrB,+CAA6C;AAApC,uGAAA,SAAS,OAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,+DAA4D;AAAnD,sHAAA,gBAAgB,OAAA;AACzB,qCAAoC;AAA3B,8FAAA,KAAK,OAAA;AACd,+CAA6C;AAApC,uGAAA,SAAS,OAAA;AAClB,iDAA+C;AAAtC,yGAAA,UAAU,OAAA;AACnB,iCAAgC;AAAvB,0FAAA,GAAG,OAAA;AACZ,uCAAsC;AAA7B,gGAAA,MAAM,OAAA;AACf,uDAAqD;AAA5C,+GAAA,aAAa,OAAA;AACtB,qCAAoC;AAA3B,8FAAA,KAAK,OAAA;AACd,uDAAoD;AAA3C,8GAAA,YAAY,OAAA;AACrB,iCAAgC;AAAvB,0FAAA,GAAG,OAAA;AACZ,qCAAoC;AAA3B,8FAAA,KAAK,OAAA"}

package/dist/lib/graph.d.ts

@@ -0,0 +1,14 @@
+export interface Graph<V, W> {
+    addVertex(vertex: V): void;
+    removeVertex(vertex: V): void;
+    addEdge(from: V, to: V, weight?: W): void;
+    removeEdge(from: V, to: V): void;
+    getNeighbors(vertex: V): V[];
+    getEdgeWeight(from: V, to: V): W;
+    getVertices(): V[];
+    hasVertex(vertex: V): boolean;
+    hasEdge(from: V, to: V): boolean;
+    vertexCount(): number;
+    edgeCount(): number;
+    clear(): void;
+}

package/dist/lib/graph.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=graph.js.map

package/dist/lib/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../lib/graph.ts"],"names":[],"mappings":""}

package/dist/lib/hash-table-utils.d.ts

@@ -0,0 +1,5 @@
+export declare class HashTableUtils {
+    private static valueToString;
+    static hash<K>(key: K, capacity: number): number;
+    static keysEqual<K>(key1: K, key2: K): boolean;
+}

package/dist/lib/hash-table-utils.js

@@ -0,0 +1,91 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.HashTableUtils = void 0;
+class HashTableUtils {
+    static valueToString(value) {
+        if (value === null || value === undefined)
+            return 'null';
+        let stringKey;
+        switch (typeof value) {
+            case 'number':
+                stringKey = value.toString();
+                break;
+            case 'object':
+                if (typeof value.toString === 'function') {
+                    stringKey = value.toString();
+                }
+                else {
+                    stringKey = JSON.stringify(value);
+                }
+                break;
+            case 'string':
+                stringKey = value;
+                break;
+            case 'function':
+                stringKey = value.toString();
+                break;
+            case 'symbol':
+                stringKey = value.toString();
+                break;
+            default:
+                stringKey = String(value);
+        }
+        return stringKey;
+    }
+    static hash(key, capacity) {
+        if (key && typeof key.hashCode === 'function') {
+            return key.hashCode();
+        }
+        if (typeof key === 'number' && Number.isSafeInteger(key)) {
+            const knuthConstant = 2654435761;
+            return (Math.abs(key * knuthConstant) >>> 0) % capacity;
+        }
+        const stringKey = this.valueToString(key);
+        let hash = 0;
+        // DJB2 hash algorithm
+        for (let i = 0; i < stringKey.length; i++) {
+            hash = ((hash << 5) + hash) + stringKey.charCodeAt(i);
+            hash = hash >>> 0; // Convert to 32-bit unsigned integer
+        }
+        return hash % capacity;
+    }
+    static keysEqual(key1, key2) {
+        if (key1 && key2 && typeof key1.equals === 'function') {
+            return key1.equals(key2);
+        }
+        if (key1 === key2)
+            return true;
+        if (typeof key1 === 'number' && typeof key2 === 'number' && isNaN(key1) && isNaN(key2))
+            return true;
+        if (typeof key1 !== 'object' && typeof key2 !== 'object')
+            return key1 === key2;
+        if (key1 instanceof Date && key2 instanceof Date) {
+            // Handle invalid dates
+            if (isNaN(key1.getTime()) && isNaN(key2.getTime()))
+                return true;
+            return key1.getTime() === key2.getTime();
+        }
+        if (key1 instanceof RegExp && key2 instanceof RegExp) {
+            return key1.toString() === key2.toString();
+        }
+        if (Array.isArray(key1) && Array.isArray(key2)) {
+            return key1.length === key2.length &&
+                key1.every((val, idx) => HashTableUtils.keysEqual(val, key2[idx]));
+        }
+        if (key1 === null && key2 === null)
+            return true;
+        if (key1 === undefined && key2 === undefined)
+            return true;
+        if (key1 === null || key1 === undefined || key2 === null || key2 === undefined)
+            return false;
+        if (typeof key1 === 'object' && typeof key2 === 'object') {
+            const keys1 = Object.keys(key1);
+            const keys2 = Object.keys(key2);
+            return keys1.length === keys2.length &&
+                keys1.every(k => k in key2 && HashTableUtils.keysEqual(key1[k], key2[k]));
+        }
+        return false;
+    }
+}
+exports.HashTableUtils = HashTableUtils;
+//# sourceMappingURL=hash-table-utils.js.map

package/dist/lib/hash-table-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash-table-utils.js","sourceRoot":"","sources":["../../lib/hash-table-utils.ts"],"names":[],"mappings":";;;AAAA,MAAa,cAAc;IACjB,MAAM,CAAC,aAAa,CAAI,KAAQ;QACtC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QACzD,IAAI,SAAiB,CAAC;QACtB,QAAQ,OAAO,KAAK,EAAE,CAAC;YACrB,KAAK,QAAQ;gBACX,SAAS,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC7B,MAAM;YACR,KAAK,QAAQ;gBACX,IAAI,OAAQ,KAAa,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;oBAClD,SAAS,GAAI,KAAa,CAAC,QAAQ,EAAE,CAAC;gBACxC,CAAC;qBAAM,CAAC;oBACN,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBACpC,CAAC;gBACD,MAAM;YACR,KAAK,QAAQ;gBACX,SAAS,GAAG,KAAK,CAAC;gBAClB,MAAM;YACR,KAAK,UAAU;gBACb,SAAS,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC7B,MAAM;YACR,KAAK,QAAQ;gBACX,SAAS,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC7B,MAAM;YACR;gBACE,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,CAAC,IAAI,CAAI,GAAM,EAAE,QAAgB;QACrC,IAAI,GAAG,IAAI,OAAQ,GAAW,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;YACvD,OAAQ,GAAW,CAAC,QAAQ,EAAE,CAAC;QACjC,CAAC;QACD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YACzD,MAAM,aAAa,GAAG,UAAU,CAAC;YACjC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,CAAC;QAC1D,CAAC;QACD,MAAM,SAAS,GAAW,IAAI,CAAC,aAAa,CAAI,GAAG,CAAC,CAAC;QACrD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,sBAAsB;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACtD,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,qCAAqC;QAC1D,CAAC;QACD,OAAO,IAAI,GAAG,QAAQ,CAAC;IACzB,CAAC;IAED,MAAM,CAAC,SAAS,CAAI,IAAO,EAAE,IAAO;QAClC,IAAI,IAAI,IAAI,IAAI,IAAI,OAAQ,IAAY,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YAC/D,OAAQ,IAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QACpG,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ;YAAE,OAAO,IAAI,KAAK,IAAI,CAAC;QAC/E,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;YACjD,uBAAuB;YACvB,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;gBAAE,OAAO,IAAI,CAAC;YAChE,OAAO,IAAI,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;QAC3C,CAAC;QACD,IAAI,IAAI,YAAY,MAAM,IAAI,IAAI,YAAY,MAAM,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC7C,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/C,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;gBAChC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,cAAc,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvE,CAAC;QACD,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAChD,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QAC1D,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAE7F,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YACzD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,OAAO,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;gBAClC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,cAAc,CAAC,SAAS,CAAE,IAAY,CAAC,CAAC,CAAC,EAAG,IAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA/ED,wCA+EC"}

package/dist/lib/hash-table.d.ts

@@ -11,6 +11,4 @@ export declare class HashTable<K, V> implements HashTable<K, V> {
     private count;
     private readonly capacity;
     constructor(capacity?: number);
-    private hash;
-    private keysEqual;
 }

package/dist/lib/hash-table.js

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.HashTable = void 0;
+const hash_table_utils_1 = require("./hash-table-utils");
 class HashNode {
     key;
     value;
@@ -16,60 +17,13 @@ class HashTable {
     count;
     capacity;
     constructor(capacity = 32) {
-        this.table = new Array(capacity).fill(null);
+        // Handle negative or zero capacity by using default capacity
+        this.capacity = capacity <= 0 ? 32 : capacity;
+        this.table = new Array(this.capacity).fill(null);
         this.count = 0;
-        this.capacity = capacity;
-    }
-    hash(key) {
-        if (typeof key.hashCode === 'function') {
-            return key.hashCode();
-        }
-        let stringKey;
-        switch (typeof key) {
-            case 'number':
-                // If the number is a safe integer, use Knuth's multiplicative method.
-                if (Number.isSafeInteger(key)) {
-                    const knuthConstant = 2654435761;
-                    return (Math.abs(key * knuthConstant) >>> 0) % this.capacity;
-                }
-                stringKey = key.toString();
-                break;
-            case 'object':
-                if (key === null) {
-                    stringKey = 'null';
-                }
-                else if (typeof key.toString === 'function') {
-                    stringKey = key.toString();
-                }
-                else {
-                    stringKey = JSON.stringify(key);
-                }
-                break;
-            case 'string':
-                stringKey = key;
-                break;
-            case 'function':
-                stringKey = key.toString();
-                break;
-            case 'symbol':
-                stringKey = key.toString();
-                break;
-            case 'undefined':
-                stringKey = 'null';
-                break;
-            default:
-                stringKey = String(key);
-        }
-        let hash = 0;
-        // DJB2 hash algorithm
-        for (let i = 0; i < stringKey.length; i++) {
-            hash = ((hash << 5) + hash) + stringKey.charCodeAt(i);
-            hash = hash >>> 0; // Convert to 32-bit unsigned integer
-        }
-        return hash % this.capacity;
     }
     insert(key, value) {
-        const index = this.hash(key);
+        const index = hash_table_utils_1.HashTableUtils.hash(key, this.capacity);
         const newNode = new HashNode(key, value);
         if (!this.table[index]) {
             this.table[index] = newNode;
@@ -78,7 +32,7 @@ class HashTable {
         }
         let current = this.table[index];
         while (current) {
-            if (this.keysEqual(current.key, key)) {
+            if (hash_table_utils_1.HashTableUtils.keysEqual(current.key, key)) {
                 current.value = value;
                 return;
             }
@@ -91,10 +45,10 @@ class HashTable {
         }
     }
     get(key) {
-        const index = this.hash(key);
+        const index = hash_table_utils_1.HashTableUtils.hash(key, this.capacity);
         let current = this.table[index];
         while (current) {
-            if (this.keysEqual(current.key, key)) {
+            if (hash_table_utils_1.HashTableUtils.keysEqual(current.key, key)) {
                 return current.value;
             }
             current = current.next;
@@ -102,11 +56,11 @@ class HashTable {
         return undefined;
     }
     remove(key) {
-        const index = this.hash(key);
+        const index = hash_table_utils_1.HashTableUtils.hash(key, this.capacity);
         let current = this.table[index];
         let prev = null;
         while (current) {
-            if (this.keysEqual(current.key, key)) {
+            if (hash_table_utils_1.HashTableUtils.keysEqual(current.key, key)) {
                 if (prev) {
                     prev.next = current.next;
                 }
@@ -121,36 +75,6 @@ class HashTable {
         }
         return false;
     }
-    keysEqual(key1, key2) {
-        // Check if keys have equals method and use it for comparison
-        if (typeof key1.equals === 'function') {
-            return key1.equals(key2);
-        }
-        if (key1 === key2)
-            return true;
-        if (key1 == null || key2 == null)
-            return false;
-        if (typeof key1 !== 'object' && typeof key2 !== 'object') {
-            return key1 === key2;
-        }
-        if (key1 instanceof Date && key2 instanceof Date) {
-            return key1.getTime() === key2.getTime();
-        }
-        if (key1 instanceof RegExp && key2 instanceof RegExp) {
-            return key1.toString() === key2.toString();
-        }
-        if (Array.isArray(key1) && Array.isArray(key2)) {
-            return key1.length === key2.length &&
-                key1.every((val, idx) => this.keysEqual(val, key2[idx]));
-        }
-        if (typeof key1 === 'object' && typeof key2 === 'object') {
-            const keys1 = Object.keys(key1);
-            const keys2 = Object.keys(key2);
-            return keys1.length === keys2.length &&
-                keys1.every(k => k in key2 && this.keysEqual(key1[k], key2[k]));
-        }
-        return false;
-    }
     size() {
         return this.count;
     }

package/dist/lib/hash-table.js.map

@@ -1 +1 @@
-{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../lib/hash-table.ts"],"names":[],"mappings":";;;AAUA,MAAM,QAAQ;IACZ,GAAG,CAAI;IACP,KAAK,CAAI;IACT,IAAI,CAAwB;IAE5B,YAAY,GAAM,EAAE,KAAQ;QAC1B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AAED,MAAa,SAAS;IACZ,KAAK,CAA+B;IACpC,KAAK,CAAS;IACL,QAAQ,CAAS;IAElC,YAAY,WAAmB,EAAE;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAEO,IAAI,CAAC,GAAM;QACjB,IAAI,OAAQ,GAAW,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;YAChD,OAAQ,GAAW,CAAC,QAAQ,EAAE,CAAC;QACjC,CAAC;QAED,IAAI,SAAiB,CAAC;QACtB,QAAQ,OAAO,GAAG,EAAE,CAAC;YACnB,KAAK,QAAQ;gBACX,sEAAsE;gBACtE,IAAI,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC9B,MAAM,aAAa,GAAG,UAAU,CAAC;oBACjC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAC/D,CAAC;gBACD,SAAS,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;gBAC3B,MAAM;YACR,KAAK,QAAQ;gBACX,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;oBACjB,SAAS,GAAG,MAAM,CAAC;gBACrB,CAAC;qBAAM,IAAI,OAAQ,GAAW,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;oBACvD,SAAS,GAAI,GAAW,CAAC,QAAQ,EAAE,CAAC;gBACtC,CAAC;qBAAM,CAAC;oBACN,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBAClC,CAAC;gBACD,MAAM;YACR,KAAK,QAAQ;gBACX,SAAS,GAAG,GAAG,CAAC;gBAChB,MAAM;YACR,KAAK,UAAU;gBACb,SAAS,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;gBAC3B,MAAM;YACR,KAAK,QAAQ;gBACX,SAAS,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;gBAC3B,MAAM;YACR,KAAK,WAAW;gBACd,SAAS,GAAG,MAAM,CAAC;gBACnB,MAAM;YACR;gBACE,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,sBAAsB;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACtD,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,qCAAqC;QAC1D,CAAC;QACD,OAAO,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC9B,CAAC;IAED,MAAM,CAAC,GAAM,EAAE,KAAQ;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;YAC5B,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,OAAO;QACT,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,OAAO,OAAO,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrC,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC;gBACtB,OAAO;YACT,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBAClB,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;gBACvB,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,OAAO;YACT,CAAC;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,OAAO,OAAO,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrC,OAAO,OAAO,CAAC,KAAK,CAAC;YACvB,CAAC;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,IAAI,GAA0B,IAAI,CAAC;QACvC,OAAO,OAAO,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACrC,IAAI,IAAI,EAAE,CAAC;oBACT,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBAC3B,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;gBACnC,CAAC;gBACD,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,GAAG,OAAO,CAAC;YACf,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,SAAS,CAAC,IAAO,EAAE,IAAO;QAChC,6DAA6D;QAC7D,IAAI,OAAQ,IAAY,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YAC/C,OAAQ,IAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;YAAE,OAAO,KAAK,CAAC;QAE/C,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YACzD,OAAO,IAAI,KAAK,IAAI,CAAC;QACvB,CAAC;QACD,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;QAC3C,CAAC;QACD,IAAI,IAAI,YAAY,MAAM,IAAI,IAAI,YAAY,MAAM,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC7C,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/C,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;gBAChC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7D,CAAC;QACD,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YACzD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,OAAO,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;gBAClC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,SAAS,CAAE,IAAY,CAAC,CAAC,CAAC,EAAG,IAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;CACF;AA5JD,8BA4JC"}
+{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../lib/hash-table.ts"],"names":[],"mappings":";;;AAAA,yDAAoD;AAapD,MAAM,QAAQ;IACZ,GAAG,CAAI;IACP,KAAK,CAAI;IACT,IAAI,CAAwB;IAE5B,YAAY,GAAM,EAAE,KAAQ;QAC1B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AAGD,MAAa,SAAS;IACZ,KAAK,CAA+B;IACpC,KAAK,CAAS;IACL,QAAQ,CAAS;IAElC,YAAY,WAAmB,EAAE;QAC/B,6DAA6D;QAC7D,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC9C,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,MAAM,CAAC,GAAM,EAAE,KAAQ;QACrB,MAAM,KAAK,GAAG,iCAAc,CAAC,IAAI,CAAI,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,OAAO,GAAG,IAAI,QAAQ,CAAO,GAAG,EAAE,KAAK,CAAC,CAAC;QAC/C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;YAC5B,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,OAAO;QACT,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,OAAO,OAAO,EAAE,CAAC;YACf,IAAI,iCAAc,CAAC,SAAS,CAAI,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAClD,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC;gBACtB,OAAO;YACT,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBAClB,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC;gBACvB,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,OAAO;YACT,CAAC;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,KAAK,GAAG,iCAAc,CAAC,IAAI,CAAI,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,OAAO,OAAO,EAAE,CAAC;YACf,IAAI,iCAAc,CAAC,SAAS,CAAI,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAClD,OAAO,OAAO,CAAC,KAAK,CAAC;YACvB,CAAC;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,KAAK,GAAG,iCAAc,CAAC,IAAI,CAAI,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,IAAI,GAA0B,IAAI,CAAC;QACvC,OAAO,OAAO,EAAE,CAAC;YACf,IAAI,iCAAc,CAAC,SAAS,CAAI,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAClD,IAAI,IAAI,EAAE,CAAC;oBACT,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBAC3B,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;gBACnC,CAAC;gBACD,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,GAAG,OAAO,CAAC;YACf,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;CACF;AA/ED,8BA+EC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "typescript-ds-lib",
-  "version": "0.2.7",
+  "version": "0.2.9",
   "description": "A collection of TypeScript data structure implementations",
   "author": "Artiom Baloian <artiom.baloian@gmail.com>",
   "license": "MIT",
@@ -8,14 +8,12 @@
   "types": "dist/index.d.ts",
   "files": [
     "dist",
-    "lib",
-    "types",
     "README.md",
     "LICENSE"
   ],
   "scripts": {
     "build": "rm -rf dist && tsc",
-    "prepare": "npm run build", 
+    "prepare": "npm run build",
     "test": "rm -rf dist && tsc && jest"
   },
   "repository": {

package/lib/binary-search-tree.ts

@@ -1,218 +0,0 @@
-import { Comparator } from '../types';
-
-
-export interface BinarySearchTree<T> {
-  insert(element: T): void;
-  remove(element: T): void;
-  find(element: T): boolean;
-  min(): T | undefined;
-  max(): T | undefined;
-  forEach(callback: (element: T) => void, traversal?: 'inorder' | 'preorder' | 'postorder'): void;
-  isEmpty(): boolean;
-  clear(): void;
-  count(): number;
-}
-
-
-class TreeNode<T> {
-  value: T;
-  left: TreeNode<T> | null;
-  right: TreeNode<T> | null;
-
-  constructor(value: T) {
-    this.value = value;
-    this.left = null;
-    this.right = null;
-  }
-}
-
-
-export class BinarySearchTree<T> implements BinarySearchTree<T> {
-  private root: TreeNode<T> | null;
-  private comparator: Comparator<T>;
-
-  constructor(comparator: Comparator<T> = (a: T, b: T) => a < b) {
-    this.root = null;
-    this.comparator = comparator;
-  }
-
-  /**
-   * Inserts a value into the BST
-   */
-  insert(value: T): void {
-    const newNode = new TreeNode(value);
-    if (!this.root) {
-      this.root = newNode;
-      return;
-    }
-    let current = this.root;
-    while (true) {
-      if (this.comparator(value, current.value)) {
-        if (current.left === null) {
-          current.left = newNode;
-          break;
-        }
-        current = current.left;
-      } else {
-        if (current.right === null) {
-          current.right = newNode;
-          break;
-        }
-        current = current.right;
-      }
-    }
-  }
-
-  /**
-   * Searches for a value in the BST. Returns true if found, false otherwise
-   */
-  find(value: T): boolean {
-    let current = this.root;
-    while (current !== null) {
-      if (this.isEqual(value, current.value)) {
-        return true;
-      }
-      if (this.comparator(value, current.value)) {
-        current = current.left;
-      } else {
-        current = current.right;
-      }
-    }
-    return false;
-  }
-
-  /**
-   * Returns the minimum value in the BST, or undefined if tree is empty
-   */
-  min(): T | undefined {
-    if (!this.root) return undefined;
-    let current = this.root;
-    while (current.left !== null) {
-      current = current.left;
-    }
-    return current.value;
-  }
-
-  /**
-   * Returns the maximum value in the BST, or undefined if tree is empty
-   */
-  max(): T | undefined {
-    if (!this.root) return undefined;
-    let current = this.root;
-    while (current.right !== null) {
-      current = current.right;
-    }
-    return current.value;
-  }
-
-  /**
-   * Removes a value from the BST if it exists
-   */
-  remove(value: T): void {
-    this.root = this.removeNode(this.root, value);
-  }
-
-  private removeNode(node: TreeNode<T> | null, value: T): TreeNode<T> | null {
-    if (node === null) return null;
-    if (this.comparator(value, node.value)) {
-      node.left = this.removeNode(node.left, value);
-      return node;
-    } else if (this.comparator(node.value, value)) {
-      node.right = this.removeNode(node.right, value);
-      return node;
-    } else {
-      // Node to delete found
-      // Case 1: Leaf node
-      if (node.left === null && node.right === null) {
-        return null;
-      }
-      // Case 2: Node with one child
-      if (node.left === null) return node.right;
-      if (node.right === null) return node.left;
-      // Case 3: Node with two children
-      const minNode = this.findMin(node.right);
-      node.value = minNode.value;
-      node.right = this.removeNode(node.right, minNode.value);
-      return node;
-    }
-  }
-
-  private findMin(node: TreeNode<T>): TreeNode<T> {
-    let current = node;
-    while (current.left !== null) {
-      current = current.left;
-    }
-    return current;
-  }
-
-  private isEqual(a: T, b: T): boolean {
-    // Two values are equal if neither is less than the other
-    return !this.comparator(a, b) && !this.comparator(b, a);
-  }
-
-  /**
-   * Executes a callback function for each element in the BST in-order traversal
-   */
-  forEach(callback: (element: T) => void, traversal: 'inorder' | 'preorder' | 'postorder' = 'inorder'): void {
-    switch (traversal) {
-      case 'inorder':
-        this.inorderTraversal(this.root, callback);
-        break;
-      case 'preorder':
-        this.preorderTraversal(this.root, callback);
-        break;
-      case 'postorder':
-        this.postorderTraversal(this.root, callback);
-        break;
-      default:
-        this.inorderTraversal(this.root, callback);
-    }
-  }
-
-  private inorderTraversal(node: TreeNode<T> | null, callback: (element: T) => void): void {
-    if (node === null) return;
-    this.inorderTraversal(node.left, callback);
-    callback(node.value);
-    this.inorderTraversal(node.right, callback);
-  }
-
-  private preorderTraversal(node: TreeNode<T> | null, callback: (element: T) => void): void {
-    if (node === null) return;
-    callback(node.value);
-    this.preorderTraversal(node.left, callback);
-    this.preorderTraversal(node.right, callback);
-  }
-
-  private postorderTraversal(node: TreeNode<T> | null, callback: (element: T) => void): void {
-    if (node === null) return;
-    this.postorderTraversal(node.left, callback);
-    this.postorderTraversal(node.right, callback);
-    callback(node.value);
-  }
-
-  /**
-   * Returns true if the BST is empty, false otherwise
-   */
-  isEmpty(): boolean {
-    return this.root === null;
-  }
-
-  /**
-   * Removes all nodes from the BST
-   */
-  clear(): void {
-    this.root = null;
-  }
-
-  /**
-   * Returns the number of nodes in the BST
-   */
-  count(): number {
-    return this.countNodes(this.root);
-  }
-
-  private countNodes(node: TreeNode<T> | null): number {
-    if (node === null) return 0;
-    return 1 + this.countNodes(node.left) + this.countNodes(node.right);
-  }
-}