data-structure-typed 2.1.1 → 2.2.0

package/dist/umd/data-structure-typed.js

@@ -1,42 +1,10 @@
 "use strict";
 var dataStructureTyped = (() => {
   var __defProp = Object.defineProperty;
-  var __defProps = Object.defineProperties;
   var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
-  var __getOwnPropDescs = Object.getOwnPropertyDescriptors;
   var __getOwnPropNames = Object.getOwnPropertyNames;
-  var __getOwnPropSymbols = Object.getOwnPropertySymbols;
   var __hasOwnProp = Object.prototype.hasOwnProperty;
-  var __propIsEnum = Object.prototype.propertyIsEnumerable;
-  var __knownSymbol = (name, symbol) => (symbol = Symbol[name]) ? symbol : /* @__PURE__ */ Symbol.for("Symbol." + name);
-  var __typeError = (msg) => {
-    throw TypeError(msg);
-  };
   var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
-  var __spreadValues = (a, b) => {
-    for (var prop in b || (b = {}))
-      if (__hasOwnProp.call(b, prop))
-        __defNormalProp(a, prop, b[prop]);
-    if (__getOwnPropSymbols)
-      for (var prop of __getOwnPropSymbols(b)) {
-        if (__propIsEnum.call(b, prop))
-          __defNormalProp(a, prop, b[prop]);
-      }
-    return a;
-  };
-  var __spreadProps = (a, b) => __defProps(a, __getOwnPropDescs(b));
-  var __objRest = (source, exclude) => {
-    var target = {};
-    for (var prop in source)
-      if (__hasOwnProp.call(source, prop) && exclude.indexOf(prop) < 0)
-        target[prop] = source[prop];
-    if (source != null && __getOwnPropSymbols)
-      for (var prop of __getOwnPropSymbols(source)) {
-        if (exclude.indexOf(prop) < 0 && __propIsEnum.call(source, prop))
-          target[prop] = source[prop];
-      }
-    return target;
-  };
   var __export = (target, all) => {
     for (var name in all)
       __defProp(target, name, { get: all[name], enumerable: true });
@@ -51,58 +19,6 @@ var dataStructureTyped = (() => {
   };
   var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
   var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
-  var __async = (__this, __arguments, generator) => {
-    return new Promise((resolve, reject) => {
-      var fulfilled = (value) => {
-        try {
-          step(generator.next(value));
-        } catch (e) {
-          reject(e);
-        }
-      };
-      var rejected = (value) => {
-        try {
-          step(generator.throw(value));
-        } catch (e) {
-          reject(e);
-        }
-      };
-      var step = (x) => x.done ? resolve(x.value) : Promise.resolve(x.value).then(fulfilled, rejected);
-      step((generator = generator.apply(__this, __arguments)).next());
-    });
-  };
-  var __await = function(promise, isYieldStar) {
-    this[0] = promise;
-    this[1] = isYieldStar;
-  };
-  var __yieldStar = (value) => {
-    var obj = value[__knownSymbol("asyncIterator")], isAwait = false, method, it = {};
-    if (obj == null) {
-      obj = value[__knownSymbol("iterator")]();
-      method = (k) => it[k] = (x) => obj[k](x);
-    } else {
-      obj = obj.call(value);
-      method = (k) => it[k] = (v) => {
-        if (isAwait) {
-          isAwait = false;
-          if (k === "throw") throw v;
-          return v;
-        }
-        isAwait = true;
-        return {
-          done: false,
-          value: new __await(new Promise((resolve) => {
-            var x = obj[k](v);
-            if (!(x instanceof Object)) __typeError("Object expected");
-            resolve(x);
-          }), 1)
-        };
-      };
-    }
-    return it[__knownSymbol("iterator")] = () => it, method("next"), "throw" in obj ? method("throw") : it.throw = (x) => {
-      throw x;
-    }, "return" in obj && method("return"), it;
-  };
 
   // src/index.ts
   var src_exports = {};
@@ -194,7 +110,7 @@ var dataStructureTyped = (() => {
      * @remarks Time O(n) to iterate, Space O(1)
      */
     *[Symbol.iterator](...args) {
-      yield* __yieldStar(this._getIterator(...args));
+      yield* this._getIterator(...args);
     }
     /**
      * Iterate over `[key, value]` pairs (may yield `undefined` values).
@@ -402,7 +318,7 @@ var dataStructureTyped = (() => {
      * Producing the iterator is O(1); consuming the entire iterator is Time O(n) with O(1) extra space.
      */
     *[Symbol.iterator](...args) {
-      yield* __yieldStar(this._getIterator(...args));
+      yield* this._getIterator(...args);
     }
     /**
      * Returns an iterator over the values (alias of the default iterator).
@@ -667,19 +583,17 @@ var dataStructureTyped = (() => {
   function makeTrampoline(fn) {
     return (...args) => trampoline(fn(...args));
   }
-  function asyncTrampoline(initial) {
-    return __async(this, null, function* () {
-      let current = yield initial;
-      while (isTrampolineThunk(current)) {
-        current = yield current.fn();
-      }
-      return current;
-    });
+  async function asyncTrampoline(initial) {
+    let current = await initial;
+    while (isTrampolineThunk(current)) {
+      current = await current.fn();
+    }
+    return current;
   }
   function makeAsyncTrampoline(fn) {
-    return (...args) => __async(null, null, function* () {
+    return async (...args) => {
       return asyncTrampoline(fn(...args));
-    });
+    };
   }
 
   // src/utils/number.ts
@@ -2207,7 +2121,7 @@ var dataStructureTyped = (() => {
      * @returns A new SinglyLinkedList with mapped values.
      */
     map(callback, options, thisArg) {
-      const out = this._createLike([], __spreadProps(__spreadValues({}, options != null ? options : {}), { maxLen: this._maxLen }));
+      const out = this._createLike([], { ...options != null ? options : {}, maxLen: this._maxLen });
       let index = 0;
       for (const value of this) out.push(callback.call(thisArg, value, index++, this));
       return out;
@@ -2218,7 +2132,7 @@ var dataStructureTyped = (() => {
      * @param value - Value to wrap in a node.
      * @returns A new SinglyLinkedListNode instance.
      */
-    _createNode(value) {
+    createNode(value) {
       return new SinglyLinkedListNode(value);
     }
     /**
@@ -2238,7 +2152,7 @@ var dataStructureTyped = (() => {
      */
     _ensureNode(elementOrNode) {
       if (this.isNode(elementOrNode)) return elementOrNode;
-      return this._createNode(elementOrNode);
+      return this.createNode(elementOrNode);
     }
     /**
      * (Protected) Normalize input into a node predicate.
@@ -2867,7 +2781,7 @@ var dataStructureTyped = (() => {
      * @returns A new DoublyLinkedList with mapped values.
      */
     map(callback, options, thisArg) {
-      const out = this._createLike([], __spreadProps(__spreadValues({}, options != null ? options : {}), { maxLen: this._maxLen }));
+      const out = this._createLike([], { ...options != null ? options : {}, maxLen: this._maxLen });
       let index = 0;
       for (const v of this) out.push(callback.call(thisArg, v, index++, this));
       return out;
@@ -3284,7 +3198,7 @@ var dataStructureTyped = (() => {
      * @returns A new Stack with mapped elements.
      */
     map(callback, options, thisArg) {
-      const out = this._createLike([], __spreadValues({}, options != null ? options : {}));
+      const out = this._createLike([], { ...options != null ? options : {} });
       let index = 0;
       for (const v of this) {
         out.push(thisArg === void 0 ? callback(v, index, this) : callback.call(thisArg, v, index, this));
@@ -4333,10 +4247,11 @@ var dataStructureTyped = (() => {
      * @returns A new Deque with mapped elements.
      */
     map(callback, options, thisArg) {
-      const out = this._createLike([], __spreadProps(__spreadValues({}, options != null ? options : {}), {
+      const out = this._createLike([], {
+        ...options != null ? options : {},
         bucketSize: this._bucketSize,
         maxLen: this._maxLen
-      }));
+      });
       let index = 0;
       for (const el of this) {
         const mv = thisArg === void 0 ? callback(el, index, this) : callback.call(thisArg, el, index, this);
@@ -4772,9 +4687,9 @@ var dataStructureTyped = (() => {
      * @returns A new heap with mapped elements.
      */
     map(callback, options, thisArg) {
-      const _a = options != null ? options : {}, { comparator, toElementFn } = _a, rest = __objRest(_a, ["comparator", "toElementFn"]);
+      const { comparator, toElementFn, ...rest } = options != null ? options : {};
       if (!comparator) throw new TypeError("Heap.map requires options.comparator for EM");
-      const out = this._createLike([], __spreadProps(__spreadValues({}, rest), { comparator, toElementFn }));
+      const out = this._createLike([], { ...rest, comparator, toElementFn });
       let i = 0;
       for (const x of this) {
         const v = thisArg === void 0 ? callback(x, i++, this) : callback.call(thisArg, x, i++, this);
@@ -4851,7 +4766,7 @@ var dataStructureTyped = (() => {
      */
     _createInstance(options) {
       const Ctor = this.constructor;
-      const next = new Ctor([], __spreadValues({ comparator: this.comparator, toElementFn: this.toElementFn }, options != null ? options : {}));
+      const next = new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
       return next;
     }
     /**
@@ -4947,7 +4862,7 @@ var dataStructureTyped = (() => {
      * @returns This heap.
      */
     push(element) {
-      const node = this._createNode(element);
+      const node = this.createNode(element);
       node.left = node;
       node.right = node;
       this.mergeWithRoot(node);
@@ -5046,7 +4961,7 @@ var dataStructureTyped = (() => {
       this._size += heapToMerge.size;
       heapToMerge.clear();
     }
-    _createNode(element) {
+    createNode(element) {
       return new FibonacciHeapNode(element);
     }
     isEmpty() {
@@ -5113,7 +5028,7 @@ var dataStructureTyped = (() => {
      * @param options Optional configuration.
      */
     constructor(elements = [], options) {
-      super(elements, __spreadValues({
+      super(elements, {
         comparator: (a, b) => {
           if (typeof a === "object" || typeof b === "object") {
             throw TypeError(
@@ -5123,8 +5038,9 @@ var dataStructureTyped = (() => {
           if (a < b) return 1;
           if (a > b) return -1;
           return 0;
-        }
-      }, options));
+        },
+        ...options
+      });
     }
   };
 
@@ -5173,7 +5089,7 @@ var dataStructureTyped = (() => {
       __publicField(this, "_options", { defaultEdgeWeight: 1 });
       __publicField(this, "_vertexMap", /* @__PURE__ */ new Map());
       const graph = options == null ? void 0 : options.graph;
-      this._options = __spreadValues({ defaultEdgeWeight: 1 }, graph != null ? graph : {});
+      this._options = { defaultEdgeWeight: 1, ...graph != null ? graph : {} };
     }
     get options() {
       return this._options;
@@ -5867,7 +5783,7 @@ var dataStructureTyped = (() => {
      * @remarks Time O(1), Space O(1)
      */
     _snapshotOptions() {
-      return { graph: __spreadValues({}, this._options) };
+      return { graph: { ...this._options } };
     }
     /**
      * Create an empty graph instance of the same concrete species (Directed/Undirected/etc).
@@ -5883,8 +5799,8 @@ var dataStructureTyped = (() => {
       const Ctor = this.constructor;
       const instance = new Ctor();
       const graph = _options == null ? void 0 : _options.graph;
-      if (graph) instance._options = __spreadValues(__spreadValues({}, instance._options), graph);
-      else instance._options = __spreadValues(__spreadValues({}, instance._options), this._options);
+      if (graph) instance._options = { ...instance._options, ...graph };
+      else instance._options = { ...instance._options, ...this._options };
       return instance;
     }
     /**
@@ -6890,7 +6806,7 @@ var dataStructureTyped = (() => {
      * @remarks Time O(1), Space O(1)
      */
     _snapshotOptions() {
-      return __spreadProps(__spreadValues({}, super._snapshotOptions()), { originCoord: this.originCoord, bottomRight: this.bottomRight });
+      return { ...super._snapshotOptions(), originCoord: this.originCoord, bottomRight: this.bottomRight };
     }
     /**
      * Re-create a same-species MapGraph instance from snapshot options.
@@ -7171,7 +7087,7 @@ var dataStructureTyped = (() => {
      * @param [value] - The value for the new node (used if not in Map mode).
      * @returns The newly created node.
      */
-    _createNode(key, value) {
+    createNode(key, value) {
       return new BinaryTreeNode(key, this._isMapMode ? void 0 : value);
     }
     /**
@@ -8112,7 +8028,7 @@ var dataStructureTyped = (() => {
      * @returns The string representation of the tree.
      */
     toVisual(startNode = this._root, options) {
-      const opts = __spreadValues({ isShowUndefined: false, isShowNull: true, isShowRedBlackNIL: false }, options);
+      const opts = { isShowUndefined: false, isShowNull: true, isShowRedBlackNIL: false, ...options };
       startNode = this.ensureNode(startNode);
       let output = "";
       if (!startNode) return output;
@@ -8275,12 +8191,12 @@ var dataStructureTyped = (() => {
         }
       } else {
         if (node.left && this.isRealNode(node)) {
-          yield* __yieldStar(this[Symbol.iterator](node.left));
+          yield* this[Symbol.iterator](node.left);
         }
         if (this._isMapMode) yield [node.key, this._store.get(node.key)];
         else yield [node.key, node.value];
         if (node.right && this.isRealNode(node)) {
-          yield* __yieldStar(this[Symbol.iterator](node.right));
+          yield* this[Symbol.iterator](node.right);
         }
       }
     }
@@ -8309,7 +8225,7 @@ var dataStructureTyped = (() => {
      */
     _createInstance(options) {
       const Ctor = this.constructor;
-      return new Ctor([], __spreadValues(__spreadValues({}, this._snapshotOptions()), options != null ? options : {}));
+      return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
     }
     /**
      * (Protected) Creates a new instance of the same tree constructor, potentially with different generic types.
@@ -8322,7 +8238,7 @@ var dataStructureTyped = (() => {
      */
     _createLike(iter = [], options) {
       const Ctor = this.constructor;
-      return new Ctor(iter, __spreadValues(__spreadValues({}, this._snapshotOptions()), options != null ? options : {}));
+      return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
     }
     /**
      * (Protected) Converts a key, node, or entry into a standardized [node, value] tuple.
@@ -8341,9 +8257,9 @@ var dataStructureTyped = (() => {
         if (key === void 0) return [void 0, void 0];
         else if (key === null) return [null, void 0];
         const finalValue = value != null ? value : entryValue;
-        return [this._createNode(key, finalValue), finalValue];
+        return [this.createNode(key, finalValue), finalValue];
       }
-      return [this._createNode(keyNodeOrEntry, value), value];
+      return [this.createNode(keyNodeOrEntry, value), value];
     }
     /**
      * (Protected) Helper for cloning. Performs a BFS and adds all nodes to the new tree.
@@ -8428,7 +8344,7 @@ var dataStructureTyped = (() => {
       destNode = this.ensureNode(destNode);
       if (srcNode && destNode) {
         const { key, value } = destNode;
-        const tempNode = this._createNode(key, value);
+        const tempNode = this.createNode(key, value);
         if (tempNode) {
           destNode.key = srcNode.key;
           if (!this._isMapMode) destNode.value = srcNode.value;
@@ -8549,7 +8465,7 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/binary-tree/bst.ts
-  var BSTNode = class extends BinaryTreeNode {
+  var BSTNode = class {
     /**
      * Creates an instance of BSTNode.
      * @remarks Time O(1), Space O(1)
@@ -8558,10 +8474,16 @@ var dataStructureTyped = (() => {
      * @param [value] - The value associated with the key.
      */
     constructor(key, value) {
-      super(key, value);
+      __publicField(this, "key");
+      __publicField(this, "value");
       __publicField(this, "parent");
       __publicField(this, "_left");
       __publicField(this, "_right");
+      __publicField(this, "_height", 0);
+      __publicField(this, "_color", "BLACK");
+      __publicField(this, "_count", 1);
+      this.key = key;
+      this.value = value;
     }
     /**
      * Gets the left child of the node.
@@ -8601,6 +8523,77 @@ var dataStructureTyped = (() => {
       if (v) v.parent = this;
       this._right = v;
     }
+    /**
+     * Gets the height of the node (used in self-balancing trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The height.
+     */
+    get height() {
+      return this._height;
+    }
+    /**
+     * Sets the height of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new height.
+     */
+    set height(value) {
+      this._height = value;
+    }
+    /**
+     * Gets the color of the node (used in Red-Black trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The node's color.
+     */
+    get color() {
+      return this._color;
+    }
+    /**
+     * Sets the color of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new color.
+     */
+    set color(value) {
+      this._color = value;
+    }
+    /**
+     * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The subtree node count.
+     */
+    get count() {
+      return this._count;
+    }
+    /**
+     * Sets the count of nodes in the subtree.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new count.
+     */
+    set count(value) {
+      this._count = value;
+    }
+    /**
+     * Gets the position of the node relative to its parent.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+     */
+    get familyPosition() {
+      if (!this.parent) {
+        return this.left || this.right ? "ROOT" : "ISOLATED";
+      }
+      if (this.parent.left === this) {
+        return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+      } else if (this.parent.right === this) {
+        return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+      }
+      return "MAL_NODE";
+    }
   };
   var BST = class extends BinaryTree {
     /**
@@ -8690,7 +8683,7 @@ var dataStructureTyped = (() => {
      * @param [value] - The value for the new node (used if not in Map mode).
      * @returns The newly created BSTNode.
      */
-    _createNode(key, value) {
+    createNode(key, value) {
       return new BSTNode(key, this._isMapMode ? void 0 : value);
     }
     /**
@@ -9160,7 +9153,7 @@ var dataStructureTyped = (() => {
      */
     _createInstance(options) {
       const Ctor = this.constructor;
-      return new Ctor([], __spreadValues(__spreadValues({}, this._snapshotOptions()), options != null ? options : {}));
+      return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
     }
     /**
      * (Protected) Creates a new instance of the same BST constructor, potentially with different generic types.
@@ -9173,7 +9166,7 @@ var dataStructureTyped = (() => {
      */
     _createLike(iter = [], options) {
       const Ctor = this.constructor;
-      return new Ctor(iter, __spreadValues(__spreadValues({}, this._snapshotOptions()), options != null ? options : {}));
+      return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
     }
     /**
      * (Protected) Snapshots the current BST's configuration options.
@@ -9183,10 +9176,11 @@ var dataStructureTyped = (() => {
      * @returns The options object.
      */
     _snapshotOptions() {
-      return __spreadProps(__spreadValues({}, super._snapshotOptions()), {
+      return {
+        ...super._snapshotOptions(),
         specifyComparable: this.specifyComparable,
         isReverse: this.isReverse
-      });
+      };
     }
     /**
      * (Protected) Converts a key, node, or entry into a standardized [node, value] tuple.
@@ -9838,7 +9832,7 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/binary-tree/avl-tree.ts
-  var AVLTreeNode = class extends BSTNode {
+  var AVLTreeNode = class {
     /**
      * Creates an instance of AVLTreeNode.
      * @remarks Time O(1), Space O(1)
@@ -9847,10 +9841,16 @@ var dataStructureTyped = (() => {
      * @param [value] - The value associated with the key.
      */
     constructor(key, value) {
-      super(key, value);
+      __publicField(this, "key");
+      __publicField(this, "value");
       __publicField(this, "parent");
       __publicField(this, "_left");
       __publicField(this, "_right");
+      __publicField(this, "_height", 0);
+      __publicField(this, "_color", "BLACK");
+      __publicField(this, "_count", 1);
+      this.key = key;
+      this.value = value;
     }
     /**
      * Gets the left child of the node.
@@ -9894,6 +9894,77 @@ var dataStructureTyped = (() => {
       }
       this._right = v;
     }
+    /**
+     * Gets the height of the node (used in self-balancing trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The height.
+     */
+    get height() {
+      return this._height;
+    }
+    /**
+     * Sets the height of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new height.
+     */
+    set height(value) {
+      this._height = value;
+    }
+    /**
+     * Gets the color of the node (used in Red-Black trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The node's color.
+     */
+    get color() {
+      return this._color;
+    }
+    /**
+     * Sets the color of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new color.
+     */
+    set color(value) {
+      this._color = value;
+    }
+    /**
+     * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The subtree node count.
+     */
+    get count() {
+      return this._count;
+    }
+    /**
+     * Sets the count of nodes in the subtree.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new count.
+     */
+    set count(value) {
+      this._count = value;
+    }
+    /**
+     * Gets the position of the node relative to its parent.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+     */
+    get familyPosition() {
+      if (!this.parent) {
+        return this.left || this.right ? "ROOT" : "ISOLATED";
+      }
+      if (this.parent.left === this) {
+        return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+      } else if (this.parent.right === this) {
+        return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+      }
+      return "MAL_NODE";
+    }
   };
   var AVLTree = class extends BST {
     /**
@@ -9915,7 +9986,7 @@ var dataStructureTyped = (() => {
      * @param [value] - The value for the new node.
      * @returns The newly created AVLTreeNode.
      */
-    _createNode(key, value) {
+    createNode(key, value) {
       return new AVLTreeNode(key, this._isMapMode ? void 0 : value);
     }
     /**
@@ -10018,7 +10089,7 @@ var dataStructureTyped = (() => {
      */
     _createInstance(options) {
       const Ctor = this.constructor;
-      return new Ctor([], __spreadValues(__spreadValues({}, this._snapshotOptions()), options != null ? options : {}));
+      return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
     }
     /**
      * (Protected) Creates a new instance of the same AVLTree constructor, potentially with different generic types.
@@ -10031,7 +10102,7 @@ var dataStructureTyped = (() => {
      */
     _createLike(iter = [], options) {
       const Ctor = this.constructor;
-      return new Ctor(iter, __spreadValues(__spreadValues({}, this._snapshotOptions()), options != null ? options : {}));
+      return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
     }
     /**
      * (Protected) Swaps properties of two nodes, including height.
@@ -10046,7 +10117,7 @@ var dataStructureTyped = (() => {
       const destNodeEnsured = this.ensureNode(destNode);
       if (srcNodeEnsured && destNodeEnsured) {
         const { key, value, height } = destNodeEnsured;
-        const tempNode = this._createNode(key, value);
+        const tempNode = this.createNode(key, value);
         if (tempNode) {
           tempNode.height = height;
           destNodeEnsured.key = srcNodeEnsured.key;
@@ -10285,7 +10356,7 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/binary-tree/red-black-tree.ts
-  var RedBlackTreeNode = class extends BSTNode {
+  var RedBlackTreeNode = class {
     /**
      * Create a Red-Black Tree and optionally bulk-insert items.
      * @remarks Time O(n log n), Space O(n)
@@ -10295,11 +10366,17 @@ var dataStructureTyped = (() => {
      * @returns New RedBlackTree instance.
      */
     constructor(key, value, color = "BLACK") {
-      super(key, value);
+      __publicField(this, "key");
+      __publicField(this, "value");
       __publicField(this, "parent");
       __publicField(this, "_left");
       __publicField(this, "_right");
-      this._color = color;
+      __publicField(this, "_height", 0);
+      __publicField(this, "_color", "BLACK");
+      __publicField(this, "_count", 1);
+      this.key = key;
+      this.value = value;
+      this.color = color;
     }
     /**
      * Get the left child pointer.
@@ -10341,61 +10418,132 @@ var dataStructureTyped = (() => {
       }
       this._right = v;
     }
-  };
-  var RedBlackTree = class extends BST {
-    constructor(keysNodesEntriesOrRaws = [], options) {
-      super([], options);
-      __publicField(this, "_root");
-      this._root = this.NIL;
-      if (keysNodesEntriesOrRaws) {
-        this.addMany(keysNodesEntriesOrRaws);
-      }
-    }
     /**
-     * Get the current root node.
+     * Gets the height of the node (used in self-balancing trees).
      * @remarks Time O(1), Space O(1)
-     * @returns Root node, or undefined.
+     *
+     * @returns The height.
      */
-    get root() {
-      return this._root;
+    get height() {
+      return this._height;
     }
     /**
-     * Create a red-black node for the given key/value (value ignored in map mode).
+     * Sets the height of the node.
      * @remarks Time O(1), Space O(1)
-     * @param key - See parameter type for details.
-     * @param [value] - See parameter type for details.
-     * @param color - See parameter type for details.
-     * @returns A new RedBlackTreeNode instance.
+     *
+     * @param value - The new height.
      */
-    _createNode(key, value, color = "BLACK") {
-      return new RedBlackTreeNode(key, this._isMapMode ? void 0 : value, color);
+    set height(value) {
+      this._height = value;
     }
     /**
-     * Type guard: check whether the input is a RedBlackTreeNode.
+     * Gets the color of the node (used in Red-Black trees).
      * @remarks Time O(1), Space O(1)
-     * @param keyNodeOrEntry - See parameter type for details.
-     * @returns True if the value is a RedBlackTreeNode.
+     *
+     * @returns The node's color.
      */
-    isNode(keyNodeOrEntry) {
-      return keyNodeOrEntry instanceof RedBlackTreeNode;
+    get color() {
+      return this._color;
     }
     /**
-     * Remove all nodes and clear the key→value store (if in map mode).
-     * @remarks Time O(n), Space O(1)
-     * @returns void
+     * Sets the color of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new color.
      */
-    clear() {
-      super.clear();
-      this._root = this.NIL;
+    set color(value) {
+      this._color = value;
     }
     /**
-     * Insert or replace an entry using BST order and red-black fix-up.
-     * @remarks Time O(log n), Space O(1)
-     * @param keyNodeOrEntry - Key, node, or [key, value] entry to insert.
-     * @param [value]- See parameter type for details.
-     * @returns True if inserted or updated; false if ignored.
+     * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The subtree node count.
      */
-    add(keyNodeOrEntry, value) {
+    get count() {
+      return this._count;
+    }
+    /**
+     * Sets the count of nodes in the subtree.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new count.
+     */
+    set count(value) {
+      this._count = value;
+    }
+    /**
+     * Gets the position of the node relative to its parent.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+     */
+    get familyPosition() {
+      if (!this.parent) {
+        return this.left || this.right ? "ROOT" : "ISOLATED";
+      }
+      if (this.parent.left === this) {
+        return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+      } else if (this.parent.right === this) {
+        return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+      }
+      return "MAL_NODE";
+    }
+  };
+  var RedBlackTree = class extends BST {
+    constructor(keysNodesEntriesOrRaws = [], options) {
+      super([], options);
+      __publicField(this, "_root");
+      this._root = this.NIL;
+      if (keysNodesEntriesOrRaws) {
+        this.addMany(keysNodesEntriesOrRaws);
+      }
+    }
+    /**
+     * Get the current root node.
+     * @remarks Time O(1), Space O(1)
+     * @returns Root node, or undefined.
+     */
+    get root() {
+      return this._root;
+    }
+    /**
+     * Create a red-black node for the given key/value (value ignored in map mode).
+     * @remarks Time O(1), Space O(1)
+     * @param key - See parameter type for details.
+     * @param [value] - See parameter type for details.
+     * @param color - See parameter type for details.
+     * @returns A new RedBlackTreeNode instance.
+     */
+    createNode(key, value, color = "BLACK") {
+      return new RedBlackTreeNode(key, this._isMapMode ? void 0 : value, color);
+    }
+    /**
+     * Type guard: check whether the input is a RedBlackTreeNode.
+     * @remarks Time O(1), Space O(1)
+     * @param keyNodeOrEntry - See parameter type for details.
+     * @returns True if the value is a RedBlackTreeNode.
+     */
+    isNode(keyNodeOrEntry) {
+      return keyNodeOrEntry instanceof RedBlackTreeNode;
+    }
+    /**
+     * Remove all nodes and clear the key→value store (if in map mode).
+     * @remarks Time O(n), Space O(1)
+     * @returns void
+     */
+    clear() {
+      super.clear();
+      this._root = this.NIL;
+    }
+    /**
+     * Insert or replace an entry using BST order and red-black fix-up.
+     * @remarks Time O(log n), Space O(1)
+     * @param keyNodeOrEntry - Key, node, or [key, value] entry to insert.
+     * @param [value]- See parameter type for details.
+     * @returns True if inserted or updated; false if ignored.
+     */
+    add(keyNodeOrEntry, value) {
       const [newNode, newValue] = this._keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value);
       if (!this.isRealNode(newNode)) return false;
       const insertStatus = this._insert(newNode);
@@ -10495,11 +10643,11 @@ var dataStructureTyped = (() => {
     }
     _createInstance(options) {
       const Ctor = this.constructor;
-      return new Ctor([], __spreadValues(__spreadValues({}, this._snapshotOptions()), options != null ? options : {}));
+      return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
     }
     _createLike(iter = [], options) {
       const Ctor = this.constructor;
-      return new Ctor(iter, __spreadValues(__spreadValues({}, this._snapshotOptions()), options != null ? options : {}));
+      return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
     }
     _setRoot(v) {
       if (v) {
@@ -10518,16 +10666,16 @@ var dataStructureTyped = (() => {
      * @returns Status string: 'CREATED' or 'UPDATED'.
      */
     _insert(node) {
-      var _a, _b;
-      let current = this.root;
+      var _a, _b, _c;
+      let current = (_a = this.root) != null ? _a : this.NIL;
       let parent = void 0;
-      while (this.isRealNode(current)) {
+      while (current !== this.NIL) {
         parent = current;
         const compared = this._compare(node.key, current.key);
         if (compared < 0) {
-          current = (_a = current.left) != null ? _a : this.NIL;
+          current = (_b = current.left) != null ? _b : this.NIL;
         } else if (compared > 0) {
-          current = (_b = current.right) != null ? _b : this.NIL;
+          current = (_c = current.right) != null ? _c : this.NIL;
         } else {
           this._replaceNode(current, node);
           return "UPDATED";
@@ -10587,7 +10735,7 @@ var dataStructureTyped = (() => {
               z = z.parent;
               this._leftRotate(z);
             }
-            if (z && this.isRealNode(z.parent) && this.isRealNode(z.parent.parent)) {
+            if (z && z.parent && z.parent.parent) {
               z.parent.color = "BLACK";
               z.parent.parent.color = "RED";
               this._rightRotate(z.parent.parent);
@@ -10605,7 +10753,7 @@ var dataStructureTyped = (() => {
               z = z.parent;
               this._rightRotate(z);
             }
-            if (z && this.isRealNode(z.parent) && this.isRealNode(z.parent.parent)) {
+            if (z && z.parent && z.parent.parent) {
               z.parent.color = "BLACK";
               z.parent.parent.color = "RED";
               this._leftRotate(z.parent.parent);
@@ -10688,7 +10836,7 @@ var dataStructureTyped = (() => {
       }
       const y = x.right;
       x.right = y.left;
-      if (this.isRealNode(y.left)) {
+      if (y.left && y.left !== this.NIL) {
         y.left.parent = x;
       }
       y.parent = x.parent;
@@ -10714,7 +10862,7 @@ var dataStructureTyped = (() => {
       }
       const x = y.left;
       y.left = x.right;
-      if (this.isRealNode(x.right)) {
+      if (x.right && x.right !== this.NIL) {
         x.right.parent = y;
       }
       x.parent = y.parent;
@@ -10731,7 +10879,7 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/binary-tree/avl-tree-multi-map.ts
-  var AVLTreeMultiMapNode = class extends AVLTreeNode {
+  var AVLTreeMultiMapNode = class {
     /**
      * Create an AVLTreeMultiMap node with a value bucket.
      * @remarks Time O(1), Space O(1)
@@ -10739,11 +10887,17 @@ var dataStructureTyped = (() => {
      * @param value - Initial array of values.
      * @returns New AVLTreeMultiMapNode instance.
      */
-    constructor(key, value) {
-      super(key, value);
+    constructor(key, value = []) {
+      __publicField(this, "key");
+      __publicField(this, "value");
       __publicField(this, "parent");
       __publicField(this, "_left");
       __publicField(this, "_right");
+      __publicField(this, "_height", 0);
+      __publicField(this, "_color", "BLACK");
+      __publicField(this, "_count", 1);
+      this.key = key;
+      this.value = value;
     }
     /**
      * Get the left child pointer.
@@ -10785,6 +10939,77 @@ var dataStructureTyped = (() => {
       }
       this._right = v;
     }
+    /**
+     * Gets the height of the node (used in self-balancing trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The height.
+     */
+    get height() {
+      return this._height;
+    }
+    /**
+     * Sets the height of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new height.
+     */
+    set height(value) {
+      this._height = value;
+    }
+    /**
+     * Gets the color of the node (used in Red-Black trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The node's color.
+     */
+    get color() {
+      return this._color;
+    }
+    /**
+     * Sets the color of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new color.
+     */
+    set color(value) {
+      this._color = value;
+    }
+    /**
+     * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The subtree node count.
+     */
+    get count() {
+      return this._count;
+    }
+    /**
+     * Sets the count of nodes in the subtree.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new count.
+     */
+    set count(value) {
+      this._count = value;
+    }
+    /**
+     * Gets the position of the node relative to its parent.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+     */
+    get familyPosition() {
+      if (!this.parent) {
+        return this.left || this.right ? "ROOT" : "ISOLATED";
+      }
+      if (this.parent.left === this) {
+        return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+      } else if (this.parent.right === this) {
+        return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+      }
+      return "MAL_NODE";
+    }
   };
   var AVLTreeMultiMap = class extends AVLTree {
     /**
@@ -10795,14 +11020,24 @@ var dataStructureTyped = (() => {
      * @returns New AVLTreeMultiMap instance.
      */
     constructor(keysNodesEntriesOrRaws = [], options) {
-      super([], __spreadProps(__spreadValues({}, options), { isMapMode: true }));
+      super([], { ...options, isMapMode: true });
       if (keysNodesEntriesOrRaws) {
         this.addMany(keysNodesEntriesOrRaws);
       }
     }
-    _createNode(key, value = []) {
+    createNode(key, value = []) {
       return new AVLTreeMultiMapNode(key, this._isMapMode ? [] : value);
     }
+    /**
+     * Checks if the given item is a `AVLTreeMultiMapNode` instance.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param keyNodeOrEntry - The item to check.
+     * @returns True if it's a AVLTreeMultiMapNode, false otherwise.
+     */
+    isNode(keyNodeOrEntry) {
+      return keyNodeOrEntry instanceof AVLTreeMultiMapNode;
+    }
     /**
      * Insert a value or a list of values into the multimap. If the key exists, values are appended.
      * @remarks Time O(log N + M), Space O(1)
@@ -10926,7 +11161,7 @@ var dataStructureTyped = (() => {
     _createInstance(options) {
       var _a, _b;
       const Ctor = this.constructor;
-      return new Ctor([], __spreadValues(__spreadValues({}, (_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}), options != null ? options : {}));
+      return new Ctor([], { ...(_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}, ...options != null ? options : {} });
     }
     /**
      * (Protected) Create a like-kind instance and seed it from an iterable.
@@ -10941,12 +11176,12 @@ var dataStructureTyped = (() => {
     _createLike(iter = [], options) {
       var _a, _b;
       const Ctor = this.constructor;
-      return new Ctor(iter, __spreadValues(__spreadValues({}, (_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}), options != null ? options : {}));
+      return new Ctor(iter, { ...(_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}, ...options != null ? options : {} });
     }
   };
 
   // src/data-structures/binary-tree/tree-multi-map.ts
-  var TreeMultiMapNode = class extends RedBlackTreeNode {
+  var TreeMultiMapNode = class {
     /**
      * Create a TreeMultiMap node with an optional value bucket.
      * @remarks Time O(1), Space O(1)
@@ -10954,11 +11189,18 @@ var dataStructureTyped = (() => {
      * @param [value] - Initial array of values.
      * @returns New TreeMultiMapNode instance.
      */
-    constructor(key, value) {
-      super(key, value);
+    constructor(key, value = [], color = "BLACK") {
+      __publicField(this, "key");
+      __publicField(this, "value");
       __publicField(this, "parent");
       __publicField(this, "_left");
       __publicField(this, "_right");
+      __publicField(this, "_height", 0);
+      __publicField(this, "_color", "BLACK");
+      __publicField(this, "_count", 1);
+      this.key = key;
+      this.value = value;
+      this.color = color;
     }
     /**
      * Get the left child pointer.
@@ -11000,6 +11242,77 @@ var dataStructureTyped = (() => {
       }
       this._right = v;
     }
+    /**
+     * Gets the height of the node (used in self-balancing trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The height.
+     */
+    get height() {
+      return this._height;
+    }
+    /**
+     * Sets the height of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new height.
+     */
+    set height(value) {
+      this._height = value;
+    }
+    /**
+     * Gets the color of the node (used in Red-Black trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The node's color.
+     */
+    get color() {
+      return this._color;
+    }
+    /**
+     * Sets the color of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new color.
+     */
+    set color(value) {
+      this._color = value;
+    }
+    /**
+     * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The subtree node count.
+     */
+    get count() {
+      return this._count;
+    }
+    /**
+     * Sets the count of nodes in the subtree.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new count.
+     */
+    set count(value) {
+      this._count = value;
+    }
+    /**
+     * Gets the position of the node relative to its parent.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+     */
+    get familyPosition() {
+      if (!this.parent) {
+        return this.left || this.right ? "ROOT" : "ISOLATED";
+      }
+      if (this.parent.left === this) {
+        return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+      } else if (this.parent.right === this) {
+        return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+      }
+      return "MAL_NODE";
+    }
   };
   var TreeMultiMap = class extends RedBlackTree {
     /**
@@ -11010,14 +11323,24 @@ var dataStructureTyped = (() => {
      * @returns New TreeMultiMap instance.
      */
     constructor(keysNodesEntriesOrRaws = [], options) {
-      super([], __spreadValues({}, options));
+      super([], { ...options });
       if (keysNodesEntriesOrRaws) {
         this.addMany(keysNodesEntriesOrRaws);
       }
     }
-    _createNode(key, value = []) {
+    createNode(key, value = []) {
       return new TreeMultiMapNode(key, this._isMapMode ? [] : value);
     }
+    /**
+     * Checks if the given item is a `TreeMultiMapNode` instance.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param keyNodeOrEntry - The item to check.
+     * @returns True if it's a TreeMultiMapNode, false otherwise.
+     */
+    isNode(keyNodeOrEntry) {
+      return keyNodeOrEntry instanceof TreeMultiMapNode;
+    }
     /**
      * Insert a value or a list of values into the multimap. If the key exists, values are appended.
      * @remarks Time O(log N + M), Space O(1)
@@ -11113,7 +11436,7 @@ var dataStructureTyped = (() => {
     _createInstance(options) {
       var _a, _b;
       const Ctor = this.constructor;
-      return new Ctor([], __spreadValues(__spreadValues({}, (_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}), options != null ? options : {}));
+      return new Ctor([], { ...(_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}, ...options != null ? options : {} });
     }
     /**
      * (Protected) Create a like-kind instance and seed it from an iterable.
@@ -11128,12 +11451,12 @@ var dataStructureTyped = (() => {
     _createLike(iter = [], options) {
       var _a, _b;
       const Ctor = this.constructor;
-      return new Ctor(iter, __spreadValues(__spreadValues({}, (_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}), options != null ? options : {}));
+      return new Ctor(iter, { ...(_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}, ...options != null ? options : {} });
     }
   };
 
   // src/data-structures/binary-tree/tree-counter.ts
-  var TreeCounterNode = class extends RedBlackTreeNode {
+  var TreeCounterNode = class {
     /**
      * Create a tree counter node.
      * @remarks Time O(1), Space O(1)
@@ -11144,10 +11467,17 @@ var dataStructureTyped = (() => {
      * @returns New TreeCounterNode instance.
      */
     constructor(key, value, count = 1, color = "BLACK") {
-      super(key, value, color);
+      __publicField(this, "key");
+      __publicField(this, "value");
       __publicField(this, "parent");
       __publicField(this, "_left");
       __publicField(this, "_right");
+      __publicField(this, "_height", 0);
+      __publicField(this, "_color", "BLACK");
+      __publicField(this, "_count", 1);
+      this.key = key;
+      this.value = value;
+      this.color = color;
       this.count = count;
     }
     /**
@@ -11190,6 +11520,77 @@ var dataStructureTyped = (() => {
       }
       this._right = v;
     }
+    /**
+     * Gets the height of the node (used in self-balancing trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The height.
+     */
+    get height() {
+      return this._height;
+    }
+    /**
+     * Sets the height of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new height.
+     */
+    set height(value) {
+      this._height = value;
+    }
+    /**
+     * Gets the color of the node (used in Red-Black trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The node's color.
+     */
+    get color() {
+      return this._color;
+    }
+    /**
+     * Sets the color of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new color.
+     */
+    set color(value) {
+      this._color = value;
+    }
+    /**
+     * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The subtree node count.
+     */
+    get count() {
+      return this._count;
+    }
+    /**
+     * Sets the count of nodes in the subtree.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new count.
+     */
+    set count(value) {
+      this._count = value;
+    }
+    /**
+     * Gets the position of the node relative to its parent.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+     */
+    get familyPosition() {
+      if (!this.parent) {
+        return this.left || this.right ? "ROOT" : "ISOLATED";
+      }
+      if (this.parent.left === this) {
+        return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+      } else if (this.parent.right === this) {
+        return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+      }
+      return "MAL_NODE";
+    }
   };
   var TreeCounter = class extends RedBlackTree {
     /**
@@ -11222,7 +11623,7 @@ var dataStructureTyped = (() => {
       this.dfs((node) => sum += node ? node.count : 0);
       return sum;
     }
-    _createNode(key, value, color = "BLACK", count) {
+    createNode(key, value, color = "BLACK", count) {
       return new TreeCounterNode(key, this._isMapMode ? void 0 : value, count, color);
     }
     /**
@@ -11423,7 +11824,7 @@ var dataStructureTyped = (() => {
      */
     _createInstance(options) {
       const Ctor = this.constructor;
-      return new Ctor([], __spreadValues(__spreadValues({}, this._snapshotOptions()), options != null ? options : {}));
+      return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
     }
     /**
      * (Protected) Create a like-kind instance and seed it from an iterable.
@@ -11437,7 +11838,10 @@ var dataStructureTyped = (() => {
      */
     _createLike(iter = [], options) {
       const Ctor = this.constructor;
-      return new Ctor(iter, __spreadValues(__spreadValues({}, this._snapshotOptions()), options != null ? options : {}));
+      return new Ctor(iter, {
+        ...this._snapshotOptions(),
+        ...options != null ? options : {}
+      });
     }
     /**
      * (Protected) Normalize input into a node plus its effective value and count.
@@ -11454,9 +11858,9 @@ var dataStructureTyped = (() => {
         const [key, entryValue] = keyNodeOrEntry;
         if (key === void 0 || key === null) return [void 0, void 0];
         const finalValue = value != null ? value : entryValue;
-        return [this._createNode(key, finalValue, "BLACK", count), finalValue];
+        return [this.createNode(key, finalValue, "BLACK", count), finalValue];
       }
-      return [this._createNode(keyNodeOrEntry, value, "BLACK", count), value];
+      return [this.createNode(keyNodeOrEntry, value, "BLACK", count), value];
     }
     /**
      * (Protected) Swap keys/values/counters between the source and destination nodes.
@@ -11470,7 +11874,7 @@ var dataStructureTyped = (() => {
       destNode = this.ensureNode(destNode);
       if (srcNode && destNode) {
         const { key, value, count, color } = destNode;
-        const tempNode = this._createNode(key, value, color, count);
+        const tempNode = this.createNode(key, value, color, count);
         if (tempNode) {
           tempNode.color = color;
           destNode.key = srcNode.key;
@@ -11500,7 +11904,7 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/binary-tree/avl-tree-counter.ts
-  var AVLTreeCounterNode = class extends AVLTreeNode {
+  var AVLTreeCounterNode = class {
     /**
      * Create an AVL counter node.
      * @remarks Time O(1), Space O(1)
@@ -11510,10 +11914,16 @@ var dataStructureTyped = (() => {
      * @returns New AVLTreeCounterNode instance.
      */
     constructor(key, value, count = 1) {
-      super(key, value);
+      __publicField(this, "key");
+      __publicField(this, "value");
       __publicField(this, "parent");
       __publicField(this, "_left");
       __publicField(this, "_right");
+      __publicField(this, "_height", 0);
+      __publicField(this, "_color", "BLACK");
+      __publicField(this, "_count", 1);
+      this.key = key;
+      this.value = value;
       this.count = count;
     }
     /**
@@ -11556,6 +11966,77 @@ var dataStructureTyped = (() => {
       }
       this._right = v;
     }
+    /**
+     * Gets the height of the node (used in self-balancing trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The height.
+     */
+    get height() {
+      return this._height;
+    }
+    /**
+     * Sets the height of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new height.
+     */
+    set height(value) {
+      this._height = value;
+    }
+    /**
+     * Gets the color of the node (used in Red-Black trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The node's color.
+     */
+    get color() {
+      return this._color;
+    }
+    /**
+     * Sets the color of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new color.
+     */
+    set color(value) {
+      this._color = value;
+    }
+    /**
+     * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The subtree node count.
+     */
+    get count() {
+      return this._count;
+    }
+    /**
+     * Sets the count of nodes in the subtree.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new count.
+     */
+    set count(value) {
+      this._count = value;
+    }
+    /**
+     * Gets the position of the node relative to its parent.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+     */
+    get familyPosition() {
+      if (!this.parent) {
+        return this.left || this.right ? "ROOT" : "ISOLATED";
+      }
+      if (this.parent.left === this) {
+        return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+      } else if (this.parent.right === this) {
+        return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+      }
+      return "MAL_NODE";
+    }
   };
   var AVLTreeCounter = class extends AVLTree {
     /**
@@ -11583,7 +12064,7 @@ var dataStructureTyped = (() => {
       this.dfs((node) => sum += node.count);
       return sum;
     }
-    _createNode(key, value, count) {
+    createNode(key, value, count) {
       return new AVLTreeCounterNode(key, this._isMapMode ? void 0 : value, count);
     }
     /**
@@ -11752,7 +12233,7 @@ var dataStructureTyped = (() => {
      */
     _createInstance(options) {
       const Ctor = this.constructor;
-      return new Ctor([], __spreadValues(__spreadValues({}, this._snapshotOptions()), options != null ? options : {}));
+      return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
     }
     /**
      * (Protected) Create a like-kind instance and seed it from an iterable.
@@ -11766,7 +12247,7 @@ var dataStructureTyped = (() => {
      */
     _createLike(iter = [], options) {
       const Ctor = this.constructor;
-      return new Ctor(iter, __spreadValues(__spreadValues({}, this._snapshotOptions()), options != null ? options : {}));
+      return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
     }
     /**
      * (Protected) Normalize input into a node plus its effective value and count.
@@ -11783,9 +12264,9 @@ var dataStructureTyped = (() => {
         const [key, entryValue] = keyNodeOrEntry;
         if (key === void 0 || key === null) return [void 0, void 0];
         const finalValue = value != null ? value : entryValue;
-        return [this._createNode(key, finalValue, count), finalValue];
+        return [this.createNode(key, finalValue, count), finalValue];
       }
-      return [this._createNode(keyNodeOrEntry, value, count), value];
+      return [this.createNode(keyNodeOrEntry, value, count), value];
     }
     /**
      * (Protected) Swap keys/values/counters between the source and destination nodes.
@@ -11799,7 +12280,7 @@ var dataStructureTyped = (() => {
       destNode = this.ensureNode(destNode);
       if (srcNode && destNode) {
         const { key, value, count, height } = destNode;
-        const tempNode = this._createNode(key, value, count);
+        const tempNode = this.createNode(key, value, count);
         if (tempNode) {
           tempNode.height = height;
           destNode.key = srcNode.key;
@@ -11858,7 +12339,7 @@ var dataStructureTyped = (() => {
      * @remarks Complexity — Time: O(n log n) when inserting n elements incrementally; Space: O(n).
      */
     constructor(elements = [], options) {
-      super(elements, __spreadValues({
+      super(elements, {
         comparator: (a, b) => {
           if (typeof a === "object" || typeof b === "object") {
             throw TypeError(
@@ -11868,8 +12349,9 @@ var dataStructureTyped = (() => {
           if (a < b) return 1;
           if (a > b) return -1;
           return 0;
-        }
-      }, options));
+        },
+        ...options
+      });
     }
   };
 
@@ -12828,10 +13310,11 @@ var dataStructureTyped = (() => {
      */
     _createInstance(options) {
       const Ctor = this.constructor;
-      const next = new Ctor([], __spreadValues({
+      const next = new Ctor([], {
         toElementFn: this.toElementFn,
-        caseSensitive: this.caseSensitive
-      }, options != null ? options : {}));
+        caseSensitive: this.caseSensitive,
+        ...options != null ? options : {}
+      });
       return next;
     }
     /**
@@ -12867,10 +13350,10 @@ var dataStructureTyped = (() => {
           yield path;
         }
         for (const [char, childNode] of node.children) {
-          yield* __yieldStar(_dfs(childNode, path + char));
+          yield* _dfs(childNode, path + char);
         }
       }
-      yield* __yieldStar(_dfs(this.root, ""));
+      yield* _dfs(this.root, "");
     }
     /**
      * (Protected) Normalize a string according to case sensitivity.