undirected-graph-typed 1.52.4 → 1.52.5

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

@@ -52,10 +52,6 @@ class Queue extends base_1.IterableElementBase {
     get size() {
         return this.elements.length - this.offset;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -67,10 +63,6 @@ class Queue extends base_1.IterableElementBase {
     get first() {
         return this.size > 0 ? this.elements[this.offset] : undefined;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -97,10 +89,6 @@ class Queue extends base_1.IterableElementBase {
     set autoCompactRatio(v) {
         this._autoCompactRatio = v;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -114,10 +102,6 @@ class Queue extends base_1.IterableElementBase {
     static fromArray(elements) {
         return new Queue(elements);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -130,10 +114,6 @@ class Queue extends base_1.IterableElementBase {
         this.elements.push(element);
         return true;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -169,10 +149,6 @@ class Queue extends base_1.IterableElementBase {
         const spliced = this.elements.splice(index, 1);
         return spliced.length === 1;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -182,10 +158,6 @@ class Queue extends base_1.IterableElementBase {
     at(index) {
         return this.elements[index + this._offset];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -196,10 +168,6 @@ class Queue extends base_1.IterableElementBase {
     isEmpty() {
         return this.size === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(n)
@@ -210,10 +178,6 @@ class Queue extends base_1.IterableElementBase {
     toArray() {
         return this.elements.slice(this.offset);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -234,11 +198,6 @@ class Queue extends base_1.IterableElementBase {
         this._offset = 0;
         return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     * where n is the number of elements in the queue. It creates a shallow copy of the internal array. the space required is proportional to the number of elements in the queue.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -249,10 +208,6 @@ class Queue extends base_1.IterableElementBase {
     clone() {
         return new Queue(this.elements.slice(this.offset), { toElementFn: this.toElementFn });
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -293,10 +248,6 @@ class Queue extends base_1.IterableElementBase {
         }
         return newDeque;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -317,10 +268,6 @@ exports.Queue = Queue;
  * 4. Frequent Enqueuing and Dequeuing Operations: If your application involves frequent enqueuing and dequeuing operations and is less concerned with random access, then LinkedListQueue is a good choice.
  */
 class LinkedListQueue extends linked_list_1.SinglyLinkedList {
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)

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

@@ -47,10 +47,6 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R, S
      * @returns A boolean value indicating whether the `_elements` array is empty or not.
      */
     isEmpty(): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -59,10 +55,6 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R, S
      * @returns The `peek()` function returns the last element of the `_elements` array, or `undefined` if the array is empty.
      */
     peek(): E | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -72,10 +64,6 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R, S
      * @returns The `push` method is returning the updated `Stack<E>` object.
      */
     push(element: E): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -97,10 +85,6 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R, S
      * @return A boolean value
      */
     deleteAt(index: number): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -109,10 +93,6 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R, S
      * @returns An array of type E.
      */
     toArray(): E[];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -120,10 +100,6 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R, S
      * The clear function clears the elements array.
      */
     clear(): void;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -132,10 +108,6 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R, S
      * @returns The `clone()` method is returning a new `Stack` object with a copy of the `_elements` array.
      */
     clone(): Stack<E, R>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -156,8 +128,7 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R, S
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The `map` function takes a callback function and applies it to each element in the stack,
      * returning a new stack with the results.
      * @param callback - The callback parameter is a function that will be called for each element in the
@@ -172,10 +143,6 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R, S
      * @returns a new Stack object with elements of type EM and raw elements of type RM.
      */
     map<EM, RM>(callback: ElementCallback<E, R, EM, Stack<E, R>>, toElementFn?: (rawElement: RM) => EM, thisArg?: any): Stack<EM, RM>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)

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

@@ -62,10 +62,6 @@ class Stack extends base_1.IterableElementBase {
     isEmpty() {
         return this.elements.length === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -78,10 +74,6 @@ class Stack extends base_1.IterableElementBase {
             return undefined;
         return this.elements[this.elements.length - 1];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -94,10 +86,6 @@ class Stack extends base_1.IterableElementBase {
         this.elements.push(element);
         return true;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -129,10 +117,6 @@ class Stack extends base_1.IterableElementBase {
         const spliced = this.elements.splice(index, 1);
         return spliced.length === 1;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -143,10 +127,6 @@ class Stack extends base_1.IterableElementBase {
     toArray() {
         return this.elements.slice();
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -156,10 +136,6 @@ class Stack extends base_1.IterableElementBase {
     clear() {
         this._elements = [];
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -170,10 +146,6 @@ class Stack extends base_1.IterableElementBase {
     clone() {
         return new Stack(this, { toElementFn: this.toElementFn });
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -204,8 +176,7 @@ class Stack extends base_1.IterableElementBase {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The `map` function takes a callback function and applies it to each element in the stack,
      * returning a new stack with the results.
      * @param callback - The callback parameter is a function that will be called for each element in the
@@ -228,10 +199,6 @@ class Stack extends base_1.IterableElementBase {
         }
         return newStack;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)

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

@@ -15,7 +15,8 @@ class TreeNode {
     constructor(key, value, children) {
         this._key = key;
         this._value = value || undefined;
-        this._children = children || [];
+        if (children)
+            this._children = children;
     }
     /**
      * The function returns the value of the protected variable _key.

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

@@ -92,10 +92,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @return The root node
      */
     get root(): TrieNode;
-    /**
-     * Time Complexity: O(l), where l is the length of the word being added.
-     * Space Complexity: O(l) - Each character in the word adds a TrieNode.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the word being added.
      * Space Complexity: O(l) - Each character in the word adds a TrieNode.
@@ -105,10 +101,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @returns {boolean} True if the word was successfully added.
      */
     add(word: string): boolean;
-    /**
-     * Time Complexity: O(l), where l is the length of the input word.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the input word.
      * Space Complexity: O(1) - Constant space.
@@ -118,10 +110,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @returns {boolean} True if the word is present in the Trie.
      */
     has(word: string): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -130,10 +118,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @return True if the size of the queue is 0
      */
     isEmpty(): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -141,10 +125,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * The clear function resets the size of the Trie to 0 and creates a new root TrieNode.
      */
     clear(): void;
-    /**
-     * Time Complexity: O(l), where l is the length of the word being deleted.
-     * Space Complexity: O(n) - Due to the recursive DFS approach.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the word being deleted.
      * Space Complexity: O(n) - Due to the recursive DFS approach.
@@ -154,20 +134,12 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @returns {boolean} True if the word was successfully removed.
      */
     delete(word: string): boolean;
-    /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(n), where n is the total number of nodes in the trie.
      * Space Complexity: O(1) - Constant space.
      *
      */
     getHeight(): number;
-    /**
-     * Time Complexity: O(l), where l is the length of the input prefix.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the input prefix.
      * Space Complexity: O(1) - Constant space.
@@ -177,10 +149,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @returns {boolean} True if it's an absolute prefix in the Trie.
      */
     hasPurePrefix(input: string): boolean;
-    /**
-     * Time Complexity: O(l), where l is the length of the input prefix.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the input prefix.
      * Space Complexity: O(1) - Constant space.
@@ -190,10 +158,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @returns {boolean} True if it's a prefix in the Trie.
      */
     hasPrefix(input: string): boolean;
-    /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(l), where l is the length of the input prefix.
-     */
     /**
      * Time Complexity: O(n), where n is the total number of nodes in the trie.
      * Space Complexity: O(l), where l is the length of the input prefix.
@@ -203,10 +167,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @returns {boolean} True if it's a common prefix in the Trie.
      */
     hasCommonPrefix(input: string): boolean;
-    /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(l), where l is the length of the longest common prefix.
-     */
     /**
      * Time Complexity: O(n), where n is the total number of nodes in the trie.
      * Space Complexity: O(l), where l is the length of the longest common prefix.
@@ -215,10 +175,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @returns {string} The longest common prefix found in the Trie.
      */
     getLongestCommonPrefix(): string;
-    /**
-     * Time Complexity: O(w * l), where w is the number of words retrieved, and l is the average length of the words.
-     * Space Complexity: O(w * l) - The space required for the output array.
-     */
     /**
      * Time Complexity: O(w * l), where w is the number of words retrieved, and l is the average length of the words.
      * Space Complexity: O(w * l) - The space required for the output array.
@@ -231,10 +187,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @returns {string[]} an array of strings.
      */
     getWords(prefix?: string, max?: number, isAllWhenEmptyPrefix?: boolean): string[];
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -244,10 +196,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @returns A new instance of the Trie class is being returned.
      */
     clone(): Trie<R>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -263,10 +211,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @returns The `filter` method is returning an array of strings (`string[]`).
      */
     filter(predicate: ElementCallback<string, R, boolean, Trie<R>>, thisArg?: any): Trie<R>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -286,10 +230,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * @returns a new Trie object.
      */
     map<RM>(callback: ElementCallback<string, R, string, Trie<R>>, toElementFn?: (rawElement: RM) => string, thisArg?: any): Trie<RM>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -298,10 +238,6 @@ export declare class Trie<R = any> extends IterableElementBase<string, R, Trie<R
      * trie data structure and yields all the paths to the end nodes.
      */
     protected _getIterator(): IterableIterator<string>;
-    /**
-     * Time Complexity: O(l), where l is the length of the input string.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the input string.
      * Space Complexity: O(1) - Constant space.

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

@@ -124,10 +124,6 @@ class Trie extends base_1.IterableElementBase {
     get root() {
         return this._root;
     }
-    /**
-     * Time Complexity: O(l), where l is the length of the word being added.
-     * Space Complexity: O(l) - Each character in the word adds a TrieNode.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the word being added.
      * Space Complexity: O(l) - Each character in the word adds a TrieNode.
@@ -155,10 +151,6 @@ class Trie extends base_1.IterableElementBase {
         }
         return isNewWord;
     }
-    /**
-     * Time Complexity: O(l), where l is the length of the input word.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the input word.
      * Space Complexity: O(1) - Constant space.
@@ -178,10 +170,6 @@ class Trie extends base_1.IterableElementBase {
         }
         return cur.isEnd;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -192,10 +180,6 @@ class Trie extends base_1.IterableElementBase {
     isEmpty() {
         return this.size === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -206,10 +190,6 @@ class Trie extends base_1.IterableElementBase {
         this._size = 0;
         this._root = new TrieNode('');
     }
-    /**
-     * Time Complexity: O(l), where l is the length of the word being deleted.
-     * Space Complexity: O(n) - Due to the recursive DFS approach.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the word being deleted.
      * Space Complexity: O(n) - Due to the recursive DFS approach.
@@ -253,10 +233,6 @@ class Trie extends base_1.IterableElementBase {
         }
         return isDeleted;
     }
-    /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(n), where n is the total number of nodes in the trie.
      * Space Complexity: O(1) - Constant space.
@@ -281,10 +257,6 @@ class Trie extends base_1.IterableElementBase {
         }
         return maxDepth;
     }
-    /**
-     * Time Complexity: O(l), where l is the length of the input prefix.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the input prefix.
      * Space Complexity: O(1) - Constant space.
@@ -304,10 +276,6 @@ class Trie extends base_1.IterableElementBase {
         }
         return !cur.isEnd;
     }
-    /**
-     * Time Complexity: O(l), where l is the length of the input prefix.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the input prefix.
      * Space Complexity: O(1) - Constant space.
@@ -327,10 +295,6 @@ class Trie extends base_1.IterableElementBase {
         }
         return true;
     }
-    /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(l), where l is the length of the input prefix.
-     */
     /**
      * Time Complexity: O(n), where n is the total number of nodes in the trie.
      * Space Complexity: O(l), where l is the length of the input prefix.
@@ -356,10 +320,6 @@ class Trie extends base_1.IterableElementBase {
         dfs(this.root);
         return commonPre === input;
     }
-    /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(l), where l is the length of the longest common prefix.
-     */
     /**
      * Time Complexity: O(n), where n is the total number of nodes in the trie.
      * Space Complexity: O(l), where l is the length of the longest common prefix.
@@ -381,10 +341,6 @@ class Trie extends base_1.IterableElementBase {
         dfs(this.root);
         return commonPre;
     }
-    /**
-     * Time Complexity: O(w * l), where w is the number of words retrieved, and l is the average length of the words.
-     * Space Complexity: O(w * l) - The space required for the output array.
-     */
     /**
      * Time Complexity: O(w * l), where w is the number of words retrieved, and l is the average length of the words.
      * Space Complexity: O(w * l) - The space required for the output array.
@@ -431,10 +387,6 @@ class Trie extends base_1.IterableElementBase {
             dfs(startNode, prefix);
         return words;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -446,10 +398,6 @@ class Trie extends base_1.IterableElementBase {
     clone() {
         return new Trie(this, { caseSensitive: this.caseSensitive, toElementFn: this.toElementFn });
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -475,10 +423,6 @@ class Trie extends base_1.IterableElementBase {
         }
         return results;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -506,10 +450,6 @@ class Trie extends base_1.IterableElementBase {
         }
         return newTrie;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -528,10 +468,6 @@ class Trie extends base_1.IterableElementBase {
         }
         yield* _dfs(this.root, '');
     }
-    /**
-     * Time Complexity: O(l), where l is the length of the input string.
-     * Space Complexity: O(1) - Constant space.
-     */
     /**
      * Time Complexity: O(l), where l is the length of the input string.
      * Space Complexity: O(1) - Constant space.

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

@@ -23,3 +23,11 @@ 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 DFSStackItem<NODE> = {
+    opt: DFSOperation;
+    node: OptBTNOrNull<NODE>;
+};

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

@@ -1,2 +1,8 @@
 "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 = {}));