heap-typed 1.50.7 → 1.50.9

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

@@ -126,7 +126,7 @@ export class BST<
     return this._root;
   }
 
-  protected _variant = BSTVariant.STANDARD;
+  protected _variant: BSTVariant = 'STANDARD';
 
   /**
    * The function returns the value of the _variant property.
@@ -207,12 +207,12 @@ export class BST<
    * @param {K | NODE | undefined} keyOrNodeOrEntry - The `key` parameter can be of type `K`, `NODE`, or
    * `undefined`.
    * @param iterationType - The `iterationType` parameter is an optional parameter that specifies the
-   * type of iteration to be performed. It has a default value of `IterationType.ITERATIVE`.
+   * type of iteration to be performed. It has a default value of `'ITERATIVE'`.
    * @returns either a node object (NODE) or undefined.
    */
   override ensureNode(
     keyOrNodeOrEntry: KeyOrNodeOrEntry<K, V, NODE>,
-    iterationType = IterationType.ITERATIVE
+    iterationType: IterationType = 'ITERATIVE'
   ): NODE | undefined {
     let res: NODE | undefined;
     if (this.isRealNode(keyOrNodeOrEntry)) {
@@ -263,7 +263,7 @@ export class BST<
 
     let current = this.root;
     while (current !== undefined) {
-      if (this._compare(current.key, newNode.key) === CP.eq) {
+      if (this._compare(current.key, newNode.key) === 'EQ') {
         // if (current !== newNode) {
         // The key value is the same but the reference is different, update the value of the existing node
         this._replaceNode(current, newNode);
@@ -275,7 +275,7 @@ export class BST<
 
         //   return;
         // }
-      } else if (this._compare(current.key, newNode.key) === CP.gt) {
+      } else if (this._compare(current.key, newNode.key) === 'GT') {
         if (current.left === undefined) {
           current.left = newNode;
           this._size++;
@@ -324,7 +324,7 @@ export class BST<
     keysOrNodesOrEntries: Iterable<KeyOrNodeOrEntry<K, V, NODE>>,
     values?: Iterable<V | undefined>,
     isBalanceAdd = true,
-    iterationType = this.iterationType
+    iterationType: IterationType = this.iterationType
   ): boolean[] {
     const inserted: boolean[] = [];
 
@@ -397,7 +397,7 @@ export class BST<
       }
     };
 
-    if (iterationType === IterationType.RECURSIVE) {
+    if (iterationType === 'RECURSIVE') {
       _dfs(sorted);
     } else {
       _iterate();
@@ -425,15 +425,16 @@ export class BST<
    * @returns The function `getNodeByKey` returns a node (`NODE`) if a node with the specified key is
    * found in the binary tree. If no node is found, it returns `undefined`.
    */
-  override getNodeByKey(key: K, iterationType = IterationType.ITERATIVE): NODE | undefined {
+  override getNodeByKey(key: K, iterationType: IterationType = 'ITERATIVE'): NODE | undefined {
+    // return this.getNodes(key, this._defaultOneParamCallback, true, this.root, iterationType)[0];
     if (!this.isRealNode(this.root)) return undefined;
-    if (iterationType === IterationType.RECURSIVE) {
+    if (iterationType === 'RECURSIVE') {
       const _dfs = (cur: NODE): NODE | undefined => {
         if (cur.key === key) return cur;
         if (!this.isRealNode(cur.left) && !this.isRealNode(cur.right)) return;
 
-        if (this._compare(cur.key, key) === CP.gt && this.isRealNode(cur.left)) return _dfs(cur.left);
-        if (this._compare(cur.key, key) === CP.lt && this.isRealNode(cur.right)) return _dfs(cur.right);
+        if (this._compare(cur.key, key) === 'GT' && this.isRealNode(cur.left)) return _dfs(cur.left);
+        if (this._compare(cur.key, key) === 'LT' && this.isRealNode(cur.right)) return _dfs(cur.right);
       };
 
       return _dfs(this.root);
@@ -442,9 +443,9 @@ export class BST<
       while (queue.size > 0) {
         const cur = queue.shift();
         if (this.isRealNode(cur)) {
-          if (this._compare(cur.key, key) === CP.eq) return cur;
-          if (this._compare(cur.key, key) === CP.gt) this.isRealNode(cur.left) && queue.push(cur.left);
-          if (this._compare(cur.key, key) === CP.lt) this.isRealNode(cur.right) && queue.push(cur.right);
+          if (this._compare(cur.key, key) === 'EQ') return cur;
+          if (this._compare(cur.key, key) === 'GT') this.isRealNode(cur.left) && queue.push(cur.left);
+          if (this._compare(cur.key, key) === 'LT') this.isRealNode(cur.right) && queue.push(cur.right);
         }
       }
     }
@@ -483,13 +484,13 @@ export class BST<
     callback: C = this._defaultOneParamCallback as C,
     onlyOne = false,
     beginRoot: KeyOrNodeOrEntry<K, V, NODE> = this.root,
-    iterationType = this.iterationType
+    iterationType: IterationType = this.iterationType
   ): NODE[] {
     beginRoot = this.ensureNode(beginRoot);
     if (!beginRoot) return [];
     const ans: NODE[] = [];
 
-    if (iterationType === IterationType.RECURSIVE) {
+    if (iterationType === 'RECURSIVE') {
       const _traverse = (cur: NODE) => {
         const callbackResult = callback(cur);
         if (callbackResult === identifier) {
@@ -500,8 +501,8 @@ export class BST<
         if (!this.isRealNode(cur.left) && !this.isRealNode(cur.right)) return;
         // TODO potential bug
         if (callback === this._defaultOneParamCallback) {
-          if (this._compare(cur.key, identifier as K) === CP.gt) this.isRealNode(cur.left) && _traverse(cur.left);
-          if (this._compare(cur.key, identifier as K) === CP.lt) this.isRealNode(cur.right) && _traverse(cur.right);
+          if (this.isRealNode(cur.left) && this._compare(cur.key, identifier as K) === 'GT') _traverse(cur.left);
+          if (this.isRealNode(cur.right) && this._compare(cur.key, identifier as K) === 'LT') _traverse(cur.right);
         } else {
           this.isRealNode(cur.left) && _traverse(cur.left);
           this.isRealNode(cur.right) && _traverse(cur.right);
@@ -510,9 +511,9 @@ export class BST<
 
       _traverse(beginRoot);
     } else {
-      const queue = new Queue<NODE>([beginRoot]);
-      while (queue.size > 0) {
-        const cur = queue.shift();
+      const stack = [beginRoot];
+      while (stack.length > 0) {
+        const cur = stack.pop();
         if (this.isRealNode(cur)) {
           const callbackResult = callback(cur);
           if (callbackResult === identifier) {
@@ -521,11 +522,19 @@ export class BST<
           }
           // TODO potential bug
           if (callback === this._defaultOneParamCallback) {
-            if (this._compare(cur.key, identifier as K) === CP.gt) this.isRealNode(cur.left) && queue.push(cur.left);
-            if (this._compare(cur.key, identifier as K) === CP.lt) this.isRealNode(cur.right) && queue.push(cur.right);
+            if (this.isRealNode(cur.right) && this._compare(cur.key, identifier as K) === 'LT') stack.push(cur.right);
+            if (this.isRealNode(cur.left) && this._compare(cur.key, identifier as K) === 'GT') stack.push(cur.left);
+
+            // if (this.isRealNode(cur.right) && this._lt(cur.key, identifier as K)) stack.push(cur.right);
+            // if (this.isRealNode(cur.left) && this._gt(cur.key, identifier as K)) stack.push(cur.left);
+
+            // // @ts-ignore
+            // if (this.isRealNode(cur.right) && cur.key > identifier) stack.push(cur.right);
+            // // @ts-ignore
+            // if (this.isRealNode(cur.left) && cur.key < identifier) stack.push(cur.left);
           } else {
-            this.isRealNode(cur.left) && queue.push(cur.left);
-            this.isRealNode(cur.right) && queue.push(cur.right);
+            this.isRealNode(cur.right) && stack.push(cur.right);
+            this.isRealNode(cur.left) && stack.push(cur.left);
           }
         }
       }
@@ -560,9 +569,9 @@ export class BST<
    */
   override dfs<C extends BTNCallback<NODE>>(
     callback: C = this._defaultOneParamCallback as C,
-    pattern: DFSOrderPattern = 'in',
+    pattern: DFSOrderPattern = 'IN',
     beginRoot: KeyOrNodeOrEntry<K, V, NODE> = this.root,
-    iterationType: IterationType = IterationType.ITERATIVE
+    iterationType: IterationType = 'ITERATIVE'
   ): ReturnType<C>[] {
     return super.dfs(callback, pattern, beginRoot, iterationType, false);
   }
@@ -592,7 +601,7 @@ export class BST<
   override bfs<C extends BTNCallback<NODE>>(
     callback: C = this._defaultOneParamCallback as C,
     beginRoot: KeyOrNodeOrEntry<K, V, NODE> = this.root,
-    iterationType = this.iterationType
+    iterationType: IterationType = this.iterationType
   ): ReturnType<C>[] {
     return super.bfs(callback, beginRoot, iterationType, false);
   }
@@ -623,7 +632,7 @@ export class BST<
   override listLevels<C extends BTNCallback<NODE>>(
     callback: C = this._defaultOneParamCallback as C,
     beginRoot: KeyOrNodeOrEntry<K, V, NODE> = this.root,
-    iterationType = this.iterationType
+    iterationType: IterationType = this.iterationType
   ): ReturnType<C>[][] {
     return super.listLevels(callback, beginRoot, iterationType, false);
   }
@@ -650,7 +659,7 @@ export class BST<
     let current = this.ensureNode(beginRoot);
     if (!current) return undefined;
 
-    if (this._variant === BSTVariant.STANDARD) {
+    if (this._variant === 'STANDARD') {
       // For BSTVariant.MIN, find the rightmost node
       while (current.right !== undefined) {
         current = current.right;
@@ -692,9 +701,9 @@ export class BST<
    */
   lesserOrGreaterTraverse<C extends BTNCallback<NODE>>(
     callback: C = this._defaultOneParamCallback as C,
-    lesserOrGreater: CP = CP.lt,
+    lesserOrGreater: CP = 'LT',
     targetNode: KeyOrNodeOrEntry<K, V, NODE> = this.root,
-    iterationType = this.iterationType
+    iterationType: IterationType = this.iterationType
   ): ReturnType<C>[] {
     targetNode = this.ensureNode(targetNode);
     const ans: ReturnType<BTNCallback<NODE>>[] = [];
@@ -703,7 +712,7 @@ export class BST<
 
     const targetKey = targetNode.key;
 
-    if (iterationType === IterationType.RECURSIVE) {
+    if (iterationType === 'RECURSIVE') {
       const _traverse = (cur: NODE) => {
         const compared = this._compare(cur.key, targetKey);
         if (compared === lesserOrGreater) ans.push(callback(cur));
@@ -746,13 +755,13 @@ export class BST<
    * values:
    * @returns The function `perfectlyBalance` returns a boolean value.
    */
-  perfectlyBalance(iterationType = this.iterationType): boolean {
-    const sorted = this.dfs(node => node, 'in'),
+  perfectlyBalance(iterationType: IterationType = this.iterationType): boolean {
+    const sorted = this.dfs(node => node, 'IN'),
       n = sorted.length;
     this.clear();
 
     if (sorted.length < 1) return false;
-    if (iterationType === IterationType.RECURSIVE) {
+    if (iterationType === 'RECURSIVE') {
       const buildBalanceBST = (l: number, r: number) => {
         if (l > r) return;
         const m = l + Math.floor((r - l) / 2);
@@ -807,12 +816,12 @@ export class BST<
    * to check if the AVL tree is balanced. It can have two possible values:
    * @returns a boolean value.
    */
-  isAVLBalanced(iterationType = this.iterationType): boolean {
+  isAVLBalanced(iterationType: IterationType = this.iterationType): boolean {
     if (!this.root) return true;
 
     let balanced = true;
 
-    if (iterationType === IterationType.RECURSIVE) {
+    if (iterationType === 'RECURSIVE') {
       const _height = (cur: NODE | undefined): number => {
         if (!cur) return 0;
         const leftHeight = _height(cur.left),
@@ -868,14 +877,49 @@ export class BST<
    * is greater than, less than, or equal to the second value.
    * @param {K} a - The parameter "a" is of type K.
    * @param {K} b - The parameter "b" in the above code represents a K.
-   * @returns a value of type CP (ComparisonResult). The possible return values are CP.gt (greater
-   * than), CP.lt (less than), or CP.eq (equal).
+   * @returns a value of type CP (ComparisonResult). The possible return values are 'GT' (greater
+   * than), 'LT' (less than), or 'EQ' (equal).
    */
   protected _compare(a: K, b: K): CP {
     const extractedA = this.extractor(a);
     const extractedB = this.extractor(b);
-    const compared = this.variant === BSTVariant.STANDARD ? extractedA - extractedB : extractedB - extractedA;
+    const compared = this.variant === 'STANDARD' ? extractedA - extractedB : extractedB - extractedA;
 
-    return compared > 0 ? CP.gt : compared < 0 ? CP.lt : CP.eq;
+    return compared > 0 ? 'GT' : compared < 0 ? 'LT' : 'EQ';
+  }
+
+  /**
+   * The function `_lt` compares two values `a` and `b` using an extractor function and returns true if
+   * `a` is less than `b` based on the specified variant.
+   * @param {K} a - The parameter "a" is of type "K", which means it can be any type. It represents the
+   * first value to be compared in the function.
+   * @param {K} b - The parameter `b` is of type `K`, which means it can be any type. It is used as one
+   * of the arguments for the comparison in the `_lt` function.
+   * @returns a boolean value.
+   */
+  protected _lt(a: K, b: K): boolean {
+    const extractedA = this.extractor(a);
+    const extractedB = this.extractor(b);
+    // return this.variant === BSTVariant.STANDARD ? extractedA < extractedB : extractedA > extractedB;
+    return this.variant === 'STANDARD' ? extractedA < extractedB : extractedA > extractedB;
+    // return extractedA < extractedB;
+    // return a < b;
+  }
+
+  /**
+   * The function compares two values using a custom extractor function and returns true if the first
+   * value is greater than the second value.
+   * @param {K} a - The parameter "a" is of type K, which means it can be any type.
+   * @param {K} b - The parameter "b" is of type K, which means it can be any type. It is used as one
+   * of the arguments for the comparison in the function.
+   * @returns a boolean value.
+   */
+  protected _gt(a: K, b: K): boolean {
+    const extractedA = this.extractor(a);
+    const extractedB = this.extractor(b);
+    // return this.variant === BSTVariant.STANDARD  ? extractedA > extractedB : extractedA < extractedB;
+    return this.variant === 'STANDARD' ? extractedA > extractedB : extractedA < extractedB;
+    // return extractedA > extractedB;
+    // return a > b;
   }
 }

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

@@ -2,6 +2,7 @@ import type {
   BinaryTreeDeleteResult,
   BSTNKeyOrNode,
   BTNCallback,
+  IterationType,
   KeyOrNodeOrEntry,
   RBTreeOptions,
   RedBlackTreeNested,
@@ -25,9 +26,9 @@ export class RedBlackTreeNode<
    * associated with the key in the Red-Black Tree Node. It is not required and can be omitted when
    * creating a new instance of the Red-Black Tree Node.
    * @param {RBTNColor} color - The `color` parameter is used to specify the color of the Red-Black
-   * Tree Node. It is an optional parameter with a default value of `RBTNColor.BLACK`.
+   * Tree Node. It is an optional parameter with a default value of `'BLACK'`.
    */
-  constructor(key: K, value?: V, color: RBTNColor = RBTNColor.BLACK) {
+  constructor(key: K, value?: V, color: RBTNColor = 'BLACK') {
     super(key, value);
     this._color = color;
   }
@@ -106,12 +107,12 @@ export class RedBlackTree<
    * @param {V} [value] - The `value` parameter is an optional parameter that represents the value
    * associated with the key in the node. It is not required and can be omitted if not needed.
    * @param {RBTNColor} color - The "color" parameter is used to specify the color of the node in a
-   * Red-Black Tree. It is an optional parameter with a default value of "RBTNColor.BLACK". The color
-   * can be either "RBTNColor.RED" or "RBTNColor.BLACK".
+   * Red-Black Tree. It is an optional parameter with a default value of "'BLACK'". The color
+   * can be either "'RED'" or "'BLACK'".
    * @returns The method is returning a new instance of a RedBlackTreeNode with the specified key,
    * value, and color.
    */
-  override createNode(key: K, value?: V, color: RBTNColor = RBTNColor.BLACK): NODE {
+  override createNode(key: K, value?: V, color: RBTNColor = 'BLACK'): NODE {
     return new RedBlackTreeNode<K, V, NODE>(key, value, color) as NODE;
   }
 
@@ -156,10 +157,10 @@ export class RedBlackTree<
       if (key === undefined || key === null) {
         return;
       } else {
-        node = this.createNode(key, value, RBTNColor.RED);
+        node = this.createNode(key, value, 'RED');
       }
     } else if (!this.isNode(keyOrNodeOrEntry)) {
-      node = this.createNode(keyOrNodeOrEntry, value, RBTNColor.RED);
+      node = this.createNode(keyOrNodeOrEntry, value, 'RED');
     } else {
       return;
     }
@@ -232,10 +233,9 @@ export class RedBlackTree<
     identifier: ReturnType<C> | undefined,
     callback: C = this._defaultOneParamCallback as C,
     beginRoot: BSTNKeyOrNode<K, NODE> = this.root,
-    iterationType = this.iterationType
+    iterationType: IterationType = this.iterationType
   ): NODE | null | undefined {
-    if ((identifier as any) instanceof RedBlackTreeNode) callback = (node => node) as C;
-    return super.getNodes(identifier, callback, true, beginRoot, iterationType)[0] ?? undefined;
+    return this.getNodes(identifier, callback, true, beginRoot, iterationType)[0] ?? undefined;
   }
 
   /**
@@ -279,16 +279,16 @@ export class RedBlackTree<
 
     const insertStatus = this._insert(newNode);
 
-    if (insertStatus === CRUD.CREATED) {
+    if (insertStatus === 'CREATED') {
       // Ensure the root is black
       if (this.isRealNode(this._root)) {
-        this._root.color = RBTNColor.BLACK;
+        this._root.color = 'BLACK';
       } else {
         return false;
       }
       this._size++;
       return true;
-    } else return insertStatus === CRUD.UPDATED;
+    } else return insertStatus === 'UPDATED';
   }
 
   /**
@@ -363,7 +363,7 @@ export class RedBlackTree<
     this._size--;
 
     // If the original color was black, fix the tree
-    if (originalColor === RBTNColor.BLACK) {
+    if (originalColor === 'BLACK') {
       this._deleteFixup(replacementNode);
     }
 
@@ -435,7 +435,7 @@ export class RedBlackTree<
         current = current.right ?? this.SENTINEL;
       } else {
         this._replaceNode(current, node);
-        return CRUD.UPDATED;
+        return 'UPDATED';
       }
     }
 
@@ -451,10 +451,10 @@ export class RedBlackTree<
 
     node.left = this.SENTINEL;
     node.right = this.SENTINEL;
-    node.color = RBTNColor.RED;
+    node.color = 'RED';
 
     this._insertFixup(node);
-    return CRUD.CREATED;
+    return 'CREATED';
   }
 
   /**
@@ -500,16 +500,16 @@ export class RedBlackTree<
    */
   protected _insertFixup(z: NODE | undefined): void {
     // Continue fixing the tree as long as the parent of z is red
-    while (z?.parent?.color === RBTNColor.RED) {
+    while (z?.parent?.color === 'RED') {
       // Check if the parent of z is the left child of its parent
       if (z.parent === z.parent.parent?.left) {
         // Case 1: The uncle (y) of z is red
         const y = z.parent.parent.right;
-        if (y?.color === RBTNColor.RED) {
+        if (y?.color === 'RED') {
           // Set colors to restore properties of Red-Black Tree
-          z.parent.color = RBTNColor.BLACK;
-          y.color = RBTNColor.BLACK;
-          z.parent.parent.color = RBTNColor.RED;
+          z.parent.color = 'BLACK';
+          y.color = 'BLACK';
+          z.parent.parent.color = 'RED';
           // Move up the tree to continue fixing
           z = z.parent.parent;
         } else {
@@ -523,8 +523,8 @@ export class RedBlackTree<
           // Case 3: The uncle (y) of z is black, and z is a left child
           // Adjust colors and perform a right rotation
           if (z && this.isRealNode(z.parent) && this.isRealNode(z.parent.parent)) {
-            z.parent.color = RBTNColor.BLACK;
-            z.parent.parent.color = RBTNColor.RED;
+            z.parent.color = 'BLACK';
+            z.parent.parent.color = 'RED';
             this._rightRotate(z.parent.parent);
           }
         }
@@ -532,10 +532,10 @@ export class RedBlackTree<
         // Symmetric case for the right child (left and right exchanged)
         // Follow the same logic as above with left and right exchanged
         const y: NODE | undefined = z?.parent?.parent?.left;
-        if (y?.color === RBTNColor.RED) {
-          z.parent.color = RBTNColor.BLACK;
-          y.color = RBTNColor.BLACK;
-          z.parent.parent!.color = RBTNColor.RED;
+        if (y?.color === 'RED') {
+          z.parent.color = 'BLACK';
+          y.color = 'BLACK';
+          z.parent.parent!.color = 'RED';
           z = z.parent.parent;
         } else {
           if (z === z.parent.left) {
@@ -544,8 +544,8 @@ export class RedBlackTree<
           }
 
           if (z && this.isRealNode(z.parent) && this.isRealNode(z.parent.parent)) {
-            z.parent.color = RBTNColor.BLACK;
-            z.parent.parent.color = RBTNColor.RED;
+            z.parent.color = 'BLACK';
+            z.parent.parent.color = 'RED';
             this._leftRotate(z.parent.parent);
           }
         }
@@ -553,7 +553,7 @@ export class RedBlackTree<
     }
 
     // Ensure that the root is black after fixing
-    if (this.isRealNode(this._root)) this._root.color = RBTNColor.BLACK;
+    if (this.isRealNode(this._root)) this._root.color = 'BLACK';
   }
 
   /**
@@ -573,14 +573,14 @@ export class RedBlackTree<
    */
   protected _deleteFixup(node: NODE | undefined): void {
     // Early exit condition
-    if (!node || node === this.root || node.color === RBTNColor.BLACK) {
+    if (!node || node === this.root || node.color === 'BLACK') {
       if (node) {
-        node.color = RBTNColor.BLACK; // Ensure the final node is black
+        node.color = 'BLACK'; // Ensure the final node is black
       }
       return;
     }
 
-    while (node && node !== this.root && node.color === RBTNColor.BLACK) {
+    while (node && node !== this.root && node.color === 'BLACK') {
       const parent: NODE | undefined = node.parent;
 
       if (!parent) {
@@ -591,22 +591,22 @@ export class RedBlackTree<
         let sibling = parent.right;
 
         // Cases 1 and 2: Sibling is red or both children of sibling are black
-        if (sibling?.color === RBTNColor.RED) {
-          sibling.color = RBTNColor.BLACK;
-          parent.color = RBTNColor.RED;
+        if (sibling?.color === 'RED') {
+          sibling.color = 'BLACK';
+          parent.color = 'RED';
           this._leftRotate(parent);
           sibling = parent.right;
         }
 
         // Case 3: Sibling's left child is black
-        if ((sibling?.left?.color ?? RBTNColor.BLACK) === RBTNColor.BLACK) {
-          if (sibling) sibling.color = RBTNColor.RED;
+        if ((sibling?.left?.color ?? 'BLACK') === 'BLACK') {
+          if (sibling) sibling.color = 'RED';
           node = parent;
         } else {
           // Case 4: Adjust colors and perform a right rotation
-          if (sibling?.left) sibling.left.color = RBTNColor.BLACK;
+          if (sibling?.left) sibling.left.color = 'BLACK';
           if (sibling) sibling.color = parent.color;
-          parent.color = RBTNColor.BLACK;
+          parent.color = 'BLACK';
           this._rightRotate(parent);
           node = this.root;
         }
@@ -615,22 +615,22 @@ export class RedBlackTree<
         let sibling = parent.left;
 
         // Cases 1 and 2: Sibling is red or both children of sibling are black
-        if (sibling?.color === RBTNColor.RED) {
-          sibling.color = RBTNColor.BLACK;
-          if (parent) parent.color = RBTNColor.RED;
+        if (sibling?.color === 'RED') {
+          sibling.color = 'BLACK';
+          if (parent) parent.color = 'RED';
           this._rightRotate(parent);
           if (parent) sibling = parent.left;
         }
 
         // Case 3: Sibling's left child is black
-        if ((sibling?.right?.color ?? RBTNColor.BLACK) === RBTNColor.BLACK) {
-          if (sibling) sibling.color = RBTNColor.RED;
+        if ((sibling?.right?.color ?? 'BLACK') === 'BLACK') {
+          if (sibling) sibling.color = 'RED';
           node = parent;
         } else {
           // Case 4: Adjust colors and perform a left rotation
-          if (sibling?.right) sibling.right.color = RBTNColor.BLACK;
+          if (sibling?.right) sibling.right.color = 'BLACK';
           if (sibling) sibling.color = parent.color;
-          if (parent) parent.color = RBTNColor.BLACK;
+          if (parent) parent.color = 'BLACK';
           this._leftRotate(parent);
           node = this.root;
         }
@@ -639,7 +639,7 @@ export class RedBlackTree<
 
     // Ensure that the final node (possibly the root) is black
     if (node) {
-      node.color = RBTNColor.BLACK;
+      node.color = 'BLACK';
     }
   }