min-heap-typed 1.40.0-rc → 1.41.0

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

@@ -0,0 +1,426 @@
+import {RBTNColor} from "../../types";
+
+export class RBTreeNode {
+  key: number = 0;
+  parent: RBTreeNode;
+  left: RBTreeNode;
+  right: RBTreeNode;
+  color: number = RBTNColor.BLACK;
+
+  constructor() {
+    this.parent = null as unknown as RBTreeNode;
+    this.left = null as unknown as RBTreeNode;
+    this.right = null as unknown as RBTreeNode;
+  }
+}
+
+export class RedBlackTree {
+  
+  constructor() {
+    this._NIL = new RBTreeNode();
+    this.NIL.color = RBTNColor.BLACK;
+    this.NIL.left = null as unknown as RBTreeNode;
+    this.NIL.right = null as unknown as RBTreeNode;
+    this._root = this.NIL;
+  }
+
+  protected _root: RBTreeNode;
+
+  get root(): RBTreeNode {
+    return this._root;
+  }
+
+  protected _NIL: RBTreeNode;
+
+  get NIL(): RBTreeNode {
+    return this._NIL;
+  }
+
+  /**
+   * The `insert` function inserts a new node with a given key into a red-black tree and fixes any
+   * violations of the red-black tree properties.
+   * @param {number} key - The key parameter is a number that represents the value to be inserted into
+   * the RBTree.
+   * @returns The function does not explicitly return anything.
+   */
+  insert(key: number): void {
+
+    const node: RBTreeNode = new RBTreeNode();
+    node.parent = null as unknown as RBTreeNode;
+    node.key = key;
+    node.left = this.NIL;
+    node.right = this.NIL;
+    node.color = RBTNColor.RED;
+
+    let y: RBTreeNode = null as unknown as RBTreeNode;
+    let x: RBTreeNode = this.root;
+
+    while (x !== this.NIL) {
+      y = x;
+      if (node.key < x.key) {
+        x = x.left;
+      } else {
+        x = x.right;
+      }
+    }
+
+    node.parent = y;
+    if (y === null) {
+      this._root = node;
+    } else if (node.key < y.key) {
+      y.left = node;
+    } else {
+      y.right = node;
+    }
+
+    if (node.parent === null) {
+      node.color = RBTNColor.BLACK;
+      return;
+    }
+
+    if (node.parent.parent === null) {
+      return;
+    }
+
+    this._fixInsert(node);
+  }
+
+  /**
+   * The `delete` function in TypeScript is used to remove a node with a specific key from a red-black
+   * tree.
+   * @param {RBTreeNode} node - The `node` parameter is of type `RBTreeNode` and represents the current
+   * node being processed in the delete operation.
+   * @returns The `delete` function does not return anything. It has a return type of `void`.
+   */
+  delete(key: number): void {
+    const helper = (node: RBTreeNode): void => {
+
+      let z: RBTreeNode = this.NIL;
+      let x: RBTreeNode, y: RBTreeNode;
+      while (node !== this.NIL) {
+        if (node.key === key) {
+          z = node;
+        }
+
+        if (node.key <= key) {
+          node = node.right;
+        } else {
+          node = node.left;
+        }
+      }
+
+      if (z === this.NIL) {
+        console.log("Couldn't find key in the tree");
+        return;
+      }
+
+      y = z;
+      let yOriginalColor: number = y.color;
+      if (z.left === this.NIL) {
+        x = z.right;
+        this._rbTransplant(z, z.right);
+      } else if (z.right === this.NIL) {
+        x = z.left;
+        this._rbTransplant(z, z.left);
+      } else {
+        y = this.getLeftMost(z.right);
+        yOriginalColor = y.color;
+        x = y.right;
+        if (y.parent === z) {
+          x.parent = y;
+        } else {
+          this._rbTransplant(y, y.right);
+          y.right = z.right;
+          y.right.parent = y;
+        }
+
+        this._rbTransplant(z, y);
+        y.left = z.left;
+        y.left.parent = y;
+        y.color = z.color;
+      }
+      if (yOriginalColor === 0) {
+        this._fixDelete(x);
+      }
+    }
+    helper(this.root);
+  }
+
+  /**
+   * The function `getNode` is a recursive depth-first search algorithm that searches for a node with a
+   * given key in a red-black tree.
+   * @param {number} key - The key parameter is a number that represents the value we are searching for
+   * in the RBTree.
+   * @param beginRoot - The `beginRoot` parameter is an optional parameter that represents the starting
+   * point for the search in the binary search tree. If no value is provided for `beginRoot`, it
+   * defaults to the root of the binary search tree (`this.root`).
+   * @returns a RBTreeNode.
+   */
+  getNode(key: number, beginRoot = this.root): RBTreeNode {
+    const dfs = (node: RBTreeNode): RBTreeNode => {
+      if (node === this.NIL || key === node.key) {
+        return node;
+      }
+
+      if (key < node.key) {
+        return dfs(node.left);
+      }
+      return dfs(node.right);
+    }
+    return dfs(beginRoot);
+  }
+
+
+  /**
+   * The function returns the leftmost node in a red-black tree.
+   * @param {RBTreeNode} node - The parameter "node" is of type RBTreeNode, which represents a node in
+   * a Red-Black Tree.
+   * @returns The leftmost node in the given RBTreeNode.
+   */
+  getLeftMost(node: RBTreeNode): RBTreeNode {
+    while (node.left !== null && node.left !== this.NIL) {
+      node = node.left;
+    }
+    return node;
+  }
+
+
+  /**
+   * The function returns the rightmost node in a red-black tree.
+   * @param {RBTreeNode} node - The parameter "node" is of type RBTreeNode.
+   * @returns the rightmost node in a red-black tree.
+   */
+  getRightMost(node: RBTreeNode): RBTreeNode {
+    while (node.right !== null && node.right !== this.NIL) {
+      node = node.right;
+    }
+    return node;
+  }
+
+  /**
+   * The function returns the successor of a given node in a red-black tree.
+   * @param {RBTreeNode} x - RBTreeNode - The node for which we want to find the successor.
+   * @returns the successor of the given RBTreeNode.
+   */
+  getSuccessor(x: RBTreeNode): RBTreeNode {
+
+    if (x.right !== this.NIL) {
+      return this.getLeftMost(x.right);
+    }
+
+    let y: RBTreeNode = x.parent;
+    while (y !== this.NIL && y !== null && x === y.right) {
+      x = y;
+      y = y.parent;
+    }
+    return y;
+  }
+
+  /**
+   * The function returns the predecessor of a given node in a red-black tree.
+   * @param {RBTreeNode} x - The parameter `x` is of type `RBTreeNode`, which represents a node in a
+   * Red-Black Tree.
+   * @returns the predecessor of the given RBTreeNode 'x'.
+   */
+  getPredecessor(x: RBTreeNode): RBTreeNode {
+
+    if (x.left !== this.NIL) {
+      return this.getRightMost(x.left);
+    }
+
+    let y: RBTreeNode = x.parent;
+    while (y !== this.NIL && x === y.left) {
+      x = y;
+      y = y.parent;
+    }
+
+    return y;
+  }
+
+  /**
+   * The function performs a left rotation on a red-black tree node.
+   * @param {RBTreeNode} x - The parameter `x` is a RBTreeNode object.
+   */
+  protected _leftRotate(x: RBTreeNode): void {
+    const y: RBTreeNode = x.right;
+    x.right = y.left;
+    if (y.left !== this.NIL) {
+      y.left.parent = x;
+    }
+    y.parent = x.parent;
+    if (x.parent === null) {
+      this._root = y;
+    } else if (x === x.parent.left) {
+      x.parent.left = y;
+    } else {
+      x.parent.right = y;
+    }
+    y.left = x;
+    x.parent = y;
+  }
+
+  /**
+   * The function performs a right rotation on a red-black tree node.
+   * @param {RBTreeNode} x - x is a RBTreeNode, which represents the node that needs to be right
+   * rotated.
+   */
+  protected _rightRotate(x: RBTreeNode): void {
+    const y: RBTreeNode = x.left;
+    x.left = y.right;
+    if (y.right !== this.NIL) {
+      y.right.parent = x;
+    }
+    y.parent = x.parent;
+    if (x.parent === null) {
+      this._root = y;
+    } else if (x === x.parent.right) {
+      x.parent.right = y;
+    } else {
+      x.parent.left = y;
+    }
+    y.right = x;
+    x.parent = y;
+  }
+
+  /**
+   * The _fixDelete function is used to rebalance the Red-Black Tree after a node deletion.
+   * @param {RBTreeNode} x - The parameter `x` is of type `RBTreeNode`, which represents a node in a
+   * red-black tree.
+   */
+  protected _fixDelete(x: RBTreeNode): void {
+    let s: RBTreeNode;
+    while (x !== this.root && x.color === 0) {
+      if (x === x.parent.left) {
+        s = x.parent.right;
+        if (s.color === 1) {
+
+          s.color = RBTNColor.BLACK;
+          x.parent.color = RBTNColor.RED;
+          this._leftRotate(x.parent);
+          s = x.parent.right;
+        }
+
+        if (s.left.color === 0 && s.right.color === 0) {
+
+          s.color = RBTNColor.RED;
+          x = x.parent;
+        } else {
+          if (s.right.color === 0) {
+
+            s.left.color = RBTNColor.BLACK;
+            s.color = RBTNColor.RED;
+            this._rightRotate(s);
+            s = x.parent.right;
+          }
+
+          s.color = x.parent.color;
+          x.parent.color = RBTNColor.BLACK;
+          s.right.color = RBTNColor.BLACK;
+          this._leftRotate(x.parent);
+          x = this.root;
+        }
+      } else {
+        s = x.parent.left;
+        if (s.color === 1) {
+
+          s.color = RBTNColor.BLACK;
+          x.parent.color = RBTNColor.RED;
+          this._rightRotate(x.parent);
+          s = x.parent.left;
+        }
+
+        if (s.right.color === 0 && s.right.color === 0) {
+
+          s.color = RBTNColor.RED;
+          x = x.parent;
+        } else {
+          if (s.left.color === 0) {
+
+            s.right.color = RBTNColor.BLACK;
+            s.color = RBTNColor.RED;
+            this._leftRotate(s);
+            s = x.parent.left;
+          }
+
+          s.color = x.parent.color;
+          x.parent.color = RBTNColor.BLACK;
+          s.left.color = RBTNColor.BLACK;
+          this._rightRotate(x.parent);
+          x = this.root;
+        }
+      }
+    }
+    x.color = RBTNColor.BLACK;
+  }
+
+  /**
+   * The function `_rbTransplant` replaces one node in a red-black tree with another node.
+   * @param {RBTreeNode} u - The parameter "u" represents a RBTreeNode object.
+   * @param {RBTreeNode} v - The parameter "v" is a RBTreeNode object.
+   */
+  protected _rbTransplant(u: RBTreeNode, v: RBTreeNode): void {
+    if (u.parent === null) {
+      this._root = v;
+    } else if (u === u.parent.left) {
+      u.parent.left = v;
+    } else {
+      u.parent.right = v;
+    }
+    v.parent = u.parent;
+  }
+
+  /**
+   * The `_fixInsert` function is used to fix the red-black tree after an insertion operation.
+   * @param {RBTreeNode} k - The parameter `k` is a RBTreeNode object, which represents a node in a
+   * red-black tree.
+   */
+  protected _fixInsert(k: RBTreeNode): void {
+    let u: RBTreeNode;
+    while (k.parent.color === 1) {
+      if (k.parent === k.parent.parent.right) {
+        u = k.parent.parent.left;
+        if (u.color === 1) {
+
+          u.color = RBTNColor.BLACK;
+          k.parent.color = RBTNColor.BLACK;
+          k.parent.parent.color = RBTNColor.RED;
+          k = k.parent.parent;
+        } else {
+          if (k === k.parent.left) {
+
+            k = k.parent;
+            this._rightRotate(k);
+          }
+
+          k.parent.color = RBTNColor.BLACK;
+          k.parent.parent.color = RBTNColor.RED;
+          this._leftRotate(k.parent.parent);
+        }
+      } else {
+        u = k.parent.parent.right;
+
+        if (u.color === 1) {
+
+          u.color = RBTNColor.BLACK;
+          k.parent.color = RBTNColor.BLACK;
+          k.parent.parent.color = RBTNColor.RED;
+          k = k.parent.parent;
+        } else {
+          if (k === k.parent.right) {
+
+            k = k.parent;
+            this._leftRotate(k);
+          }
+
+          k.parent.color = RBTNColor.BLACK;
+          k.parent.parent.color = RBTNColor.RED;
+          this._rightRotate(k.parent.parent);
+        }
+      }
+      if (k === this.root) {
+        break;
+      }
+    }
+    this.root.color = RBTNColor.BLACK;
+  }
+}

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

@@ -0,0 +1,190 @@
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+
+import type {SegmentTreeNodeVal} from '../../types';
+
+export class SegmentTreeNode {
+  start = 0;
+  end = 0;
+  value: SegmentTreeNodeVal | null = null;
+  sum = 0;
+  left: SegmentTreeNode | null = null;
+  right: SegmentTreeNode | null = null;
+
+  constructor(start: number, end: number, sum: number, value?: SegmentTreeNodeVal | null) {
+    this.start = start;
+    this.end = end;
+    this.sum = sum;
+    this.value = value || null;
+  }
+}
+
+export class SegmentTree {
+  /**
+   * The constructor initializes the values, start, end, and root properties of an object.
+   * @param {number[]} values - An array of numbers that will be used to build a binary search tree.
+   * @param {number} [start] - The `start` parameter is the index of the first element in the `values` array that should
+   * be included in the range. If no value is provided for `start`, it defaults to 0, which means the range starts from
+   * the beginning of the array.
+   * @param {number} [end] - The "end" parameter is the index of the last element in the "values" array that should be
+   * included in the range. If not provided, it defaults to the index of the last element in the "values" array.
+   */
+  constructor(values: number[], start?: number, end?: number) {
+    start = start || 0;
+    end = end || values.length - 1;
+    this._values = values;
+    this._start = start;
+    this._end = end;
+
+    if (values.length > 0) {
+      this._root = this.build(start, end);
+    } else {
+      this._root = null;
+      this._values = [];
+    }
+  }
+
+  protected _values: number[] = [];
+
+  get values(): number[] {
+    return this._values;
+  }
+
+  protected _start = 0;
+
+  get start(): number {
+    return this._start;
+  }
+
+  protected _end: number;
+
+  get end(): number {
+    return this._end;
+  }
+
+  protected _root: SegmentTreeNode | null;
+
+  get root(): SegmentTreeNode | null {
+    return this._root;
+  }
+
+  /**
+   * The build function creates a segment tree by recursively dividing the given range into smaller segments and assigning
+   * the sum of values to each segment.
+   * @param {number} start - The `start` parameter represents the starting index of the segment or range for which we are
+   * building the segment tree.
+   * @param {number} end - The "end" parameter represents the ending index of the segment or range for which we want to
+   * build a segment tree.
+   * @returns a SegmentTreeNode object.
+   */
+  build(start: number, end: number): SegmentTreeNode {
+    if (start > end) {
+      return new SegmentTreeNode(start, end, 0);
+    }
+    if (start === end) return new SegmentTreeNode(start, end, this._values[start]);
+
+    const mid = start + Math.floor((end - start) / 2);
+    const left = this.build(start, mid);
+    const right = this.build(mid + 1, end);
+    const cur = new SegmentTreeNode(start, end, left.sum + right.sum);
+    cur.left = left;
+    cur.right = right;
+    return cur;
+  }
+
+  /**
+   * The function updates the value of a node in a segment tree and recalculates the sum of its children if they exist.
+   * @param {number} index - The index parameter represents the index of the node in the segment tree that needs to be
+   * updated.
+   * @param {number} sum - The `sum` parameter represents the new value that should be assigned to the `sum` property of
+   * the `SegmentTreeNode` at the specified `index`.
+   * @param {SegmentTreeNodeVal} [value] - The `value` parameter is an optional value that can be assigned to the `value`
+   * property of the `SegmentTreeNode` object. It is not currently used in the code, but you can uncomment the line `//
+   * cur.value = value;` and pass a value for `value` in the
+   * @returns The function does not return anything.
+   */
+  updateNode(index: number, sum: number, value?: SegmentTreeNodeVal) {
+    const root = this.root || null;
+    if (!root) {
+      return;
+    }
+    const dfs = (cur: SegmentTreeNode, index: number, sum: number, value?: SegmentTreeNodeVal) => {
+      if (cur.start === cur.end && cur.start === index) {
+        cur.sum = sum;
+        if (value !== undefined) cur.value = value;
+        return;
+      }
+      const mid = cur.start + Math.floor((cur.end - cur.start) / 2);
+      if (index <= mid) {
+        if (cur.left) {
+          dfs(cur.left, index, sum, value);
+        }
+      } else {
+        if (cur.right) {
+          dfs(cur.right, index, sum, value);
+        }
+      }
+      if (cur.left && cur.right) {
+        cur.sum = cur.left.sum + cur.right.sum;
+      }
+    };
+
+    dfs(root, index, sum, value);
+  }
+
+  /**
+   * The function `querySumByRange` calculates the sum of values within a given range in a segment tree.
+   * @param {number} indexA - The starting index of the range for which you want to calculate the sum.
+   * @param {number} indexB - The parameter `indexB` represents the ending index of the range for which you want to
+   * calculate the sum.
+   * @returns The function `querySumByRange` returns a number.
+   */
+  querySumByRange(indexA: number, indexB: number): number {
+    const root = this.root || null;
+    if (!root) {
+      return 0;
+    }
+
+    if (indexA < 0 || indexB >= this.values.length || indexA > indexB) {
+      return NaN;
+    }
+
+    const dfs = (cur: SegmentTreeNode, i: number, j: number): number => {
+      if (i <= cur.start && j >= cur.end) {
+        // The range [i, j] completely covers the current node's range [cur.start, cur.end]
+        return cur.sum;
+      }
+      const mid = cur.start + Math.floor((cur.end - cur.start) / 2);
+      if (j <= mid) {
+        if (cur.left) {
+          return dfs(cur.left, i, j);
+        } else {
+          return NaN;
+        }
+      } else if (i > mid) {
+        if (cur.right) {
+          return dfs(cur.right, i, j);
+        } else {
+          return NaN;
+        }
+      } else {
+        // Query both left and right subtrees
+        let leftSum = 0;
+        let rightSum = 0;
+        if (cur.left) {
+          leftSum = dfs(cur.left, i, mid);
+        }
+        if (cur.right) {
+          rightSum = dfs(cur.right, mid + 1, j);
+        }
+        return leftSum + rightSum;
+      }
+    };
+    return dfs(root, indexA, indexB);
+  }
+}