red-black-tree-typed 1.47.3

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

@@ -0,0 +1,326 @@
+"use strict";
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Trie = exports.TrieNode = void 0;
+/**
+ * TrieNode represents a node in the Trie data structure. It holds a character key, a map of children nodes,
+ * and a flag indicating whether it's the end of a word.
+ */
+class TrieNode {
+    constructor(key) {
+        this.key = key;
+        this.isEnd = false;
+        this.children = new Map();
+    }
+}
+exports.TrieNode = TrieNode;
+/**
+ * Trie represents a Trie data structure. It provides basic Trie operations and additional methods.
+ */
+class Trie {
+    constructor(words, caseSensitive = true) {
+        this._root = new TrieNode('');
+        this._caseSensitive = caseSensitive;
+        if (words) {
+            for (const i of words) {
+                this.add(i);
+            }
+        }
+    }
+    get caseSensitive() {
+        return this._caseSensitive;
+    }
+    get root() {
+        return this._root;
+    }
+    /**
+     * Time Complexity: O(M), where M is the length of the word being added.
+     * Space Complexity: O(M) - Each character in the word adds a TrieNode.
+     */
+    /**
+     * Time Complexity: O(M), where M is the length of the word being added.
+     * Space Complexity: O(M) - Each character in the word adds a TrieNode.
+     *
+     * Add a word to the Trie structure.
+     * @param {string} word - The word to add.
+     * @returns {boolean} True if the word was successfully added.
+     */
+    add(word) {
+        word = this._caseProcess(word);
+        let cur = this.root;
+        for (const c of word) {
+            let nodeC = cur.children.get(c);
+            if (!nodeC) {
+                nodeC = new TrieNode(c);
+                cur.children.set(c, nodeC);
+            }
+            cur = nodeC;
+        }
+        cur.isEnd = true;
+        return true;
+    }
+    /**
+     * Time Complexity: O(M), where M is the length of the input word.
+     * Space Complexity: O(1) - Constant space.
+     */
+    /**
+     * Time Complexity: O(M), where M is the length of the input word.
+     * Space Complexity: O(1) - Constant space.
+     *
+     * Check if the Trie contains a given word.
+     * @param {string} word - The word to check for.
+     * @returns {boolean} True if the word is present in the Trie.
+     */
+    has(word) {
+        word = this._caseProcess(word);
+        let cur = this.root;
+        for (const c of word) {
+            const nodeC = cur.children.get(c);
+            if (!nodeC)
+                return false;
+            cur = nodeC;
+        }
+        return cur.isEnd;
+    }
+    /**
+     * Time Complexity: O(M), where M is the length of the word being deleted.
+     * Space Complexity: O(M) - Due to the recursive DFS approach.
+     */
+    /**
+     * Time Complexity: O(M), where M is the length of the word being deleted.
+     * Space Complexity: O(M) - Due to the recursive DFS approach.
+     *
+     * Remove a word from the Trie structure.
+     * @param{string} word - The word to delete.
+     * @returns {boolean} True if the word was successfully removed.
+     */
+    delete(word) {
+        word = this._caseProcess(word);
+        let isDeleted = false;
+        const dfs = (cur, i) => {
+            const char = word[i];
+            const child = cur.children.get(char);
+            if (child) {
+                if (i === word.length - 1) {
+                    if (child.isEnd) {
+                        if (child.children.size > 0) {
+                            child.isEnd = false;
+                        }
+                        else {
+                            cur.children.delete(char);
+                        }
+                        isDeleted = true;
+                        return true;
+                    }
+                    return false;
+                }
+                const res = dfs(child, i + 1);
+                if (res && !cur.isEnd && child.children.size === 0) {
+                    cur.children.delete(char);
+                    return true;
+                }
+                return false;
+            }
+            return false;
+        };
+        dfs(this.root, 0);
+        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.
+     *
+     */
+    getHeight() {
+        const beginRoot = this.root;
+        let maxDepth = 0;
+        if (beginRoot) {
+            const bfs = (node, level) => {
+                if (level > maxDepth) {
+                    maxDepth = level;
+                }
+                const { children } = node;
+                if (children) {
+                    for (const child of children.entries()) {
+                        bfs(child[1], level + 1);
+                    }
+                }
+            };
+            bfs(beginRoot, 0);
+        }
+        return maxDepth;
+    }
+    /**
+     * Time Complexity: O(M), where M is the length of the input prefix.
+     * Space Complexity: O(1) - Constant space.
+     */
+    /**
+     * Time Complexity: O(M), where M is the length of the input prefix.
+     * Space Complexity: O(1) - Constant space.
+     *
+     * Check if a given input string has an absolute prefix in the Trie, meaning it's not a complete word.
+     * @param {string} input - The input string to check.
+     * @returns {boolean} True if it's an absolute prefix in the Trie.
+     */
+    hasPurePrefix(input) {
+        input = this._caseProcess(input);
+        let cur = this.root;
+        for (const c of input) {
+            const nodeC = cur.children.get(c);
+            if (!nodeC)
+                return false;
+            cur = nodeC;
+        }
+        return !cur.isEnd;
+    }
+    /**
+     * Time Complexity: O(M), where M is the length of the input prefix.
+     * Space Complexity: O(1) - Constant space.
+     */
+    /**
+     * Time Complexity: O(M), where M is the length of the input prefix.
+     * Space Complexity: O(1) - Constant space.
+     *
+     * Check if a given input string is a prefix of any existing word in the Trie, whether as an absolute prefix or a complete word.
+     * @param {string} input - The input string representing the prefix to check.
+     * @returns {boolean} True if it's a prefix in the Trie.
+     */
+    hasPrefix(input) {
+        input = this._caseProcess(input);
+        let cur = this.root;
+        for (const c of input) {
+            const nodeC = cur.children.get(c);
+            if (!nodeC)
+                return false;
+            cur = nodeC;
+        }
+        return true;
+    }
+    /**
+     * Time Complexity: O(N), where N is the total number of nodes in the trie.
+     * Space Complexity: O(M), where M 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(M), where M is the length of the input prefix.
+     *
+     * Check if the input string is a common prefix in the Trie, meaning it's a prefix shared by all words in the Trie.
+     * @param {string} input - The input string representing the common prefix to check for.
+     * @returns {boolean} True if it's a common prefix in the Trie.
+     */
+    hasCommonPrefix(input) {
+        input = this._caseProcess(input);
+        let commonPre = '';
+        const dfs = (cur) => {
+            commonPre += cur.key;
+            if (commonPre === input)
+                return;
+            if (cur.isEnd)
+                return;
+            if (cur && cur.children && cur.children.size === 1)
+                dfs(Array.from(cur.children.values())[0]);
+            else
+                return;
+        };
+        dfs(this.root);
+        return commonPre === input;
+    }
+    /**
+     * Time Complexity: O(N), where N is the total number of nodes in the trie.
+     * Space Complexity: O(M), where M 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(M), where M is the length of the longest common prefix.
+     *
+     * Get the longest common prefix among all the words stored in the Trie.
+     * @returns {string} The longest common prefix found in the Trie.
+     */
+    getLongestCommonPrefix() {
+        let commonPre = '';
+        const dfs = (cur) => {
+            commonPre += cur.key;
+            if (cur.isEnd)
+                return;
+            if (cur && cur.children && cur.children.size === 1)
+                dfs(Array.from(cur.children.values())[0]);
+            else
+                return;
+        };
+        dfs(this.root);
+        return commonPre;
+    }
+    /**
+     * Time Complexity: O(K * L), where K is the number of words retrieved, and L is the average length of the words.
+     * Space Complexity: O(K * L) - The space required for the output array.
+     */
+    /**
+     * Time Complexity: O(K * L), where K is the number of words retrieved, and L is the average length of the words.
+     * Space Complexity: O(K * L) - The space required for the output array.
+     *
+     * The `getAll` function returns an array of all words in a Trie data structure that start with a given prefix.
+     * @param {string} prefix - The `prefix` parameter is a string that represents the prefix that we want to search for in the
+     * trie. It is an optional parameter, so if no prefix is provided, it will default to an empty string.
+     * @param {number} max - The max count of words will be found
+     * @param isAllWhenEmptyPrefix - If true, when the prefix provided as '', returns all the words in the trie.
+     * @returns {string[]} an array of strings.
+     */
+    getWords(prefix = '', max = Number.MAX_SAFE_INTEGER, isAllWhenEmptyPrefix = false) {
+        prefix = this._caseProcess(prefix);
+        const words = [];
+        let found = 0;
+        function dfs(node, word) {
+            for (const char of node.children.keys()) {
+                const charNode = node.children.get(char);
+                if (charNode !== undefined) {
+                    dfs(charNode, word.concat(char));
+                }
+            }
+            if (node.isEnd) {
+                if (found > max - 1)
+                    return;
+                words.push(word);
+                found++;
+            }
+        }
+        let startNode = this.root;
+        if (prefix) {
+            for (const c of prefix) {
+                const nodeC = startNode.children.get(c);
+                if (nodeC)
+                    startNode = nodeC;
+            }
+        }
+        if (isAllWhenEmptyPrefix || startNode !== this.root)
+            dfs(startNode, prefix);
+        return words;
+    }
+    /**
+     * Time Complexity: O(M), where M is the length of the input string.
+     * Space Complexity: O(1) - Constant space.
+     */
+    /**
+     * Time Complexity: O(M), where M is the length of the input string.
+     * Space Complexity: O(1) - Constant space.
+     *
+     * @param str
+     * @protected
+     */
+    _caseProcess(str) {
+        if (!this._caseSensitive) {
+            str = str.toLowerCase(); // Convert str to lowercase if case-insensitive
+        }
+        return str;
+    }
+}
+exports.Trie = Trie;

package/dist/index.d.ts

@@ -0,0 +1,10 @@
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+export * from './data-structures/binary-tree/rb-tree';
+export * from './types/data-structures/binary-tree/rb-tree';
+export * from './types/common';

package/dist/index.js

@@ -0,0 +1,27 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+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 });
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+// export { RedBlackTreeNode, RedBlackTree, CP, FamilyPosition, TopologicalProperty, IterationType } from 'data-structure-typed';
+__exportStar(require("./data-structures/binary-tree/rb-tree"), exports);
+__exportStar(require("./types/data-structures/binary-tree/rb-tree"), exports);
+__exportStar(require("./types/common"), exports);

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

@@ -0,0 +1,7 @@
+import { BinaryTree, BinaryTreeNode } from '../data-structures';
+import { BinaryTreeNested, BinaryTreeNodeNested, BiTreeDeleteResult, BTNCallback, BTNKey } from '../types';
+export interface IBinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNodeNested<V>, TREE extends BinaryTree<V, N, TREE> = BinaryTreeNested<V, N>> {
+    createNode(key: BTNKey, value?: N['value']): N;
+    add(keyOrNode: BTNKey | N | null, value?: N['value']): N | null | undefined;
+    delete<C extends BTNCallback<N>>(identifier: ReturnType<C> | null, callback: C): BiTreeDeleteResult<N>[];
+}

package/dist/interfaces/binary-tree.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/dist/interfaces/doubly-linked-list.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/interfaces/doubly-linked-list.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/dist/interfaces/graph.d.ts

@@ -0,0 +1,5 @@
+import { VertexKey } from '../types';
+export interface IGraph<V, E, VO, EO> {
+    createVertex(key: VertexKey, value?: V): VO;
+    createEdge(srcOrV1: VertexKey, destOrV2: VertexKey, weight?: number, value?: E): EO;
+}

package/dist/interfaces/graph.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/dist/interfaces/heap.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/interfaces/heap.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/dist/interfaces/index.d.ts

@@ -0,0 +1,8 @@
+export * from './graph';
+export * from './binary-tree';
+export * from './doubly-linked-list';
+export * from './heap';
+export * from './navigator';
+export * from './priority-queue';
+export * from './segment-tree';
+export * from './singly-linked-list';

package/dist/interfaces/index.js

@@ -0,0 +1,24 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+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 });
+__exportStar(require("./graph"), exports);
+__exportStar(require("./binary-tree"), exports);
+__exportStar(require("./doubly-linked-list"), exports);
+__exportStar(require("./heap"), exports);
+__exportStar(require("./navigator"), exports);
+__exportStar(require("./priority-queue"), exports);
+__exportStar(require("./segment-tree"), exports);
+__exportStar(require("./singly-linked-list"), exports);

package/dist/interfaces/navigator.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/interfaces/navigator.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/dist/interfaces/priority-queue.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/interfaces/priority-queue.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

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

@@ -0,0 +1 @@
+export {};

package/dist/interfaces/segment-tree.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/dist/interfaces/singly-linked-list.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/interfaces/singly-linked-list.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/dist/types/common.d.ts

@@ -0,0 +1,20 @@
+export type Comparator<T> = (a: T, b: T) => number;
+export type DFSOrderPattern = 'pre' | 'in' | 'post';
+export type BTNCallback<N, D = any> = (node: N) => D;
+export declare enum CP {
+    lt = "lt",
+    eq = "eq",
+    gt = "gt"
+}
+export interface IterableWithSize<T> extends Iterable<T> {
+    size: number | ((...args: any[]) => number);
+}
+export interface IterableWithLength<T> extends Iterable<T> {
+    length: number | ((...args: any[]) => number);
+}
+export type IterableWithSizeOrLength<T> = IterableWithSize<T> | IterableWithLength<T>;
+export type BinaryTreePrintOptions = {
+    isShowUndefined?: boolean;
+    isShowNull?: boolean;
+    isShowRedBlackNIL?: boolean;
+};

package/dist/types/common.js

@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CP = void 0;
+var CP;
+(function (CP) {
+    CP["lt"] = "lt";
+    CP["eq"] = "eq";
+    CP["gt"] = "gt";
+})(CP = exports.CP || (exports.CP = {}));

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

@@ -0,0 +1,5 @@
+import { AVLTree, AVLTreeNode } from '../../../data-structures';
+import { BSTOptions } from './bst';
+export type AVLTreeNodeNested<T> = AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
+export type AVLTreeNested<T, N extends AVLTreeNode<T, N>> = AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, AVLTree<T, N, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
+export type AVLTreeOptions = BSTOptions & {};

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

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

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

@@ -0,0 +1,31 @@
+import { BinaryTree, BinaryTreeNode } from '../../../data-structures';
+/**
+ * Enum representing different loop types.
+ *
+ * - `iterative`: Indicates the iterative loop type (with loops that use iterations).
+ * - `recursive`: Indicates the recursive loop type (with loops that call themselves).
+ */
+export declare enum IterationType {
+    ITERATIVE = "ITERATIVE",
+    RECURSIVE = "RECURSIVE"
+}
+export declare enum FamilyPosition {
+    ROOT = "ROOT",
+    LEFT = "LEFT",
+    RIGHT = "RIGHT",
+    ROOT_LEFT = "ROOT_LEFT",
+    ROOT_RIGHT = "ROOT_RIGHT",
+    ISOLATED = "ISOLATED",
+    MAL_NODE = "MAL_NODE"
+}
+export type BTNKey = number;
+export type BiTreeDeleteResult<N> = {
+    deleted: N | null | undefined;
+    needBalanced: N | null | undefined;
+};
+export type BinaryTreeNodeNested<T> = BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
+export type BinaryTreeNested<T, N extends BinaryTreeNode<T, N>> = BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
+export type BinaryTreeOptions = {
+    iterationType?: IterationType;
+};
+export type NodeDisplayLayout = [string[], number, number, number];

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

@@ -0,0 +1,24 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.FamilyPosition = exports.IterationType = void 0;
+/**
+ * Enum representing different loop types.
+ *
+ * - `iterative`: Indicates the iterative loop type (with loops that use iterations).
+ * - `recursive`: Indicates the recursive loop type (with loops that call themselves).
+ */
+var IterationType;
+(function (IterationType) {
+    IterationType["ITERATIVE"] = "ITERATIVE";
+    IterationType["RECURSIVE"] = "RECURSIVE";
+})(IterationType = exports.IterationType || (exports.IterationType = {}));
+var FamilyPosition;
+(function (FamilyPosition) {
+    FamilyPosition["ROOT"] = "ROOT";
+    FamilyPosition["LEFT"] = "LEFT";
+    FamilyPosition["RIGHT"] = "RIGHT";
+    FamilyPosition["ROOT_LEFT"] = "ROOT_LEFT";
+    FamilyPosition["ROOT_RIGHT"] = "ROOT_RIGHT";
+    FamilyPosition["ISOLATED"] = "ISOLATED";
+    FamilyPosition["MAL_NODE"] = "MAL_NODE";
+})(FamilyPosition = exports.FamilyPosition || (exports.FamilyPosition = {}));

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

@@ -0,0 +1,8 @@
+import { BST, BSTNode } from '../../../data-structures';
+import type { BinaryTreeOptions, BTNKey } from './binary-tree';
+export type BSTComparator = (a: BTNKey, b: BTNKey) => number;
+export type BSTNodeNested<T> = BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
+export type BSTNested<T, N extends BSTNode<T, N>> = BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, BST<T, N, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
+export type BSTOptions = BinaryTreeOptions & {
+    comparator?: BSTComparator;
+};

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

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

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

@@ -0,0 +1,6 @@
+export * from './binary-tree';
+export * from './bst';
+export * from './avl-tree';
+export * from './segment-tree';
+export * from './tree-multimap';
+export * from './rb-tree';

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

@@ -0,0 +1,22 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+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 });
+__exportStar(require("./binary-tree"), exports);
+__exportStar(require("./bst"), exports);
+__exportStar(require("./avl-tree"), exports);
+__exportStar(require("./segment-tree"), exports);
+__exportStar(require("./tree-multimap"), exports);
+__exportStar(require("./rb-tree"), exports);

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

@@ -0,0 +1,9 @@
+import { RedBlackTree, RedBlackTreeNode } from '../../../data-structures';
+import { BSTOptions } from "./bst";
+export declare enum RBTNColor {
+    RED = 1,
+    BLACK = 0
+}
+export type RedBlackTreeNodeNested<T> = RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, RedBlackTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
+export type RedBlackTreeNested<T, N extends RedBlackTreeNode<T, N>> = RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, RedBlackTree<T, N, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
+export type RBTreeOptions = BSTOptions & {};

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

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