data-structure-typed 1.18.5 → 1.18.7

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

@@ -6,12 +6,14 @@
  * @license MIT License
  */
 import { BST, BSTNode } from './bst';
-import type { AVLTreeDeleted, BinaryTreeNodeId, RecursiveAVLTreeNode } from '../types';
-import { IBinaryTreeNode } from '../interfaces';
-export declare class AVLTreeNode<T, FAMILY extends AVLTreeNode<T, FAMILY> = RecursiveAVLTreeNode<T>> extends BSTNode<T, FAMILY> implements IBinaryTreeNode<T, FAMILY> {
+import type { AVLTreeOptions, BinaryTreeDeletedResult, BinaryTreeNodeId, RecursiveAVLTreeNode } from '../types';
+import { IAVLTree, IAVLTreeNode } from '../interfaces';
+export declare class AVLTreeNode<T, FAMILY extends AVLTreeNode<T, FAMILY> = RecursiveAVLTreeNode<T>> extends BSTNode<T, FAMILY> implements IAVLTreeNode<T, FAMILY> {
+    createNode(id: BinaryTreeNodeId, val?: T, count?: number): FAMILY;
 }
-export declare class AVLTree<N extends AVLTreeNode<N['val'], N> = AVLTreeNode<number>> extends BST<N> {
-    _createNode(id: BinaryTreeNodeId, val: N['val'], count?: number): N;
+export declare class AVLTree<N extends AVLTreeNode<N['val'], N> = AVLTreeNode<number>> extends BST<N> implements IAVLTree<N> {
+    constructor(options?: AVLTreeOptions);
+    createNode(id: BinaryTreeNodeId, val?: N['val'], count?: number): N;
     /**
      * The function overrides the add method of a Binary Search Tree to insert a node with a given id and value, and then
      * balances the tree.
@@ -35,7 +37,7 @@ export declare class AVLTree<N extends AVLTreeNode<N['val'], N> = AVLTreeNode<nu
      * `isUpdateAllLeftSum` is set to `true`, the left sum of all nodes will be recalculated.
      * @returns The method is returning an array of `AVLTreeDeleted<N>` objects.
      */
-    remove(id: BinaryTreeNodeId, isUpdateAllLeftSum?: boolean): AVLTreeDeleted<N>[];
+    remove(id: BinaryTreeNodeId, isUpdateAllLeftSum?: boolean): BinaryTreeDeletedResult<N>[];
     /**
      * The balance factor of a given AVL tree node is calculated by subtracting the height of its left subtree from the
      * height of its right subtree.

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

@@ -40,17 +40,19 @@ var AVLTreeNode = /** @class */ (function (_super) {
     function AVLTreeNode() {
         return _super !== null && _super.apply(this, arguments) || this;
     }
+    AVLTreeNode.prototype.createNode = function (id, val, count) {
+        return new AVLTreeNode(id, (val === undefined ? id : val), count);
+    };
     return AVLTreeNode;
 }(bst_1.BSTNode));
 exports.AVLTreeNode = AVLTreeNode;
 var AVLTree = /** @class */ (function (_super) {
     __extends(AVLTree, _super);
-    function AVLTree() {
-        return _super !== null && _super.apply(this, arguments) || this;
+    function AVLTree(options) {
+        return _super.call(this, options) || this;
     }
-    AVLTree.prototype._createNode = function (id, val, count) {
-        var node = new AVLTreeNode(id, val, count);
-        return node;
+    AVLTree.prototype.createNode = function (id, val, count) {
+        return new AVLTreeNode(id, (val === undefined ? id : val), count);
     };
     /**
      * The function overrides the add method of a Binary Search Tree to insert a node with a given id and value, and then

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

@@ -5,88 +5,30 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { BinaryTreeDeleted, BinaryTreeNodeId, BinaryTreeNodePropertyName, DFSOrderPattern, NodeOrPropertyName, RecursiveBinaryTreeNode, ResultsByProperty } from '../types';
-import { IBinaryTree, IBinaryTreeNode } from '../interfaces';
-export declare enum FamilyPosition {
-    root = 0,
-    left = 1,
-    right = 2
-}
-/**
- * Enum representing different loop types.
- *
- * - `iterative`: Indicates the iterative loop type (with loops that use iterations).
- * - `recursive`: Indicates the recursive loop type (with loops that call themselves).
- */
-export declare enum LoopType {
-    iterative = 1,
-    recursive = 2
-}
-export declare class BinaryTreeNode<T, FAMILY extends BinaryTreeNode<T, FAMILY> = RecursiveBinaryTreeNode<T>> implements IBinaryTreeNode<T, FAMILY> {
-    constructor(id: BinaryTreeNodeId, val: T, count?: number);
-    private _id;
-    get id(): BinaryTreeNodeId;
-    set id(v: BinaryTreeNodeId);
-    private _val;
-    get val(): T;
-    set val(v: T);
-    private _left?;
-    get left(): FAMILY | null | undefined;
-    set left(v: FAMILY | null | undefined);
-    private _right?;
-    get right(): FAMILY | null | undefined;
-    set right(v: FAMILY | null | undefined);
-    private _parent;
-    get parent(): FAMILY | null | undefined;
-    set parent(v: FAMILY | null | undefined);
-    private _familyPosition;
-    get familyPosition(): FamilyPosition;
-    set familyPosition(v: FamilyPosition);
-    private _count;
-    get count(): number;
-    set count(v: number);
-    private _height;
-    get height(): number;
-    set height(v: number);
-    _createNode(id: BinaryTreeNodeId, val: T | null, count?: number): FAMILY | null;
-    swapLocation(swapNode: FAMILY): FAMILY;
-    clone(): FAMILY | null;
+import type { BinaryTreeNodeId, RecursiveBinaryTreeNode } from '../types';
+import { BinaryTreeOptions } from '../types';
+import { AbstractBinaryTree, AbstractBinaryTreeNode } from './abstract-binary-tree';
+import { IBinaryTree, IBinaryTreeNode } from '../interfaces/binary-tree';
+export declare class BinaryTreeNode<T = number, FAMILY extends BinaryTreeNode<T, FAMILY> = RecursiveBinaryTreeNode<T>> extends AbstractBinaryTreeNode<T, FAMILY> implements IBinaryTreeNode<T, FAMILY> {
+    /**
+     * The function creates a new binary tree node with an optional value and count, and returns it as a specified type.
+     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier for the binary tree node. It is of type
+     * `BinaryTreeNodeId`, which could be a string or a number depending on how you want to identify your nodes.
+     * @param {T} [val] - The `val` parameter is an optional value that can be assigned to the node. It represents the
+     * value stored in the node.
+     * @param {number} [count] - The count parameter is an optional parameter that represents the number of times the value
+     * appears in the binary tree node.
+     * @returns a new instance of the BinaryTreeNode class, casted as the FAMILY type.
+     */
+    createNode(id: BinaryTreeNodeId, val?: T, count?: number): FAMILY;
 }
-export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTreeNode<number>> implements IBinaryTree<N> {
+export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTreeNode> extends AbstractBinaryTree<N> implements IBinaryTree<N> {
     /**
      * The constructor function accepts an optional options object and sets the values of loopType, autoIncrementId, and
      * isDuplicatedVal based on the provided options.
      * @param [options] - An optional object that can contain the following properties:
      */
-    constructor(options?: {
-        loopType?: LoopType;
-        autoIncrementId?: boolean;
-        isDuplicatedVal?: boolean;
-    });
-    private _loopType;
-    get loopType(): LoopType;
-    private _visitedId;
-    get visitedId(): BinaryTreeNodeId[];
-    private _visitedVal;
-    get visitedVal(): Array<N['val']>;
-    private _visitedNode;
-    get visitedNode(): N[];
-    private _visitedCount;
-    get visitedCount(): number[];
-    private _visitedLeftSum;
-    get visitedLeftSum(): number[];
-    private _autoIncrementId;
-    get autoIncrementId(): boolean;
-    private _maxId;
-    get maxId(): number;
-    private _isDuplicatedVal;
-    get isDuplicatedVal(): boolean;
-    private _root;
-    get root(): N | null;
-    private _size;
-    get size(): number;
-    private _count;
-    get count(): number;
+    constructor(options?: BinaryTreeOptions);
     /**
      * The function creates a new binary tree node with the given id, value, and count if the value is not null, otherwise
      * it returns null.
@@ -98,265 +40,5 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
      * of occurrences of the value in the binary tree node. If not provided, the default value is `undefined`.
      * @returns a BinaryTreeNode object if the value is not null, otherwise it returns null.
      */
-    _createNode(id: BinaryTreeNodeId, val: N['val'] | null, count?: number): N | null;
-    /**
-     * The clear function resets the state of an object by setting its properties to their initial values.
-     */
-    clear(): void;
-    /**
-     * The function checks if the size of an object is equal to zero and returns a boolean value.
-     * @returns A boolean value indicating whether the size of the object is 0 or not.
-     */
-    isEmpty(): boolean;
-    /**
-     * The `add` function inserts a new node with a given ID and value into a binary tree, updating the count if the node
-     * already exists.
-     * @param {BinaryTreeNodeId} id - The id parameter is the identifier of the binary tree node. It is used to uniquely
-     * identify each node in the binary tree.
-     * @param {N} val - The value to be inserted into the binary tree.
-     * @param {number} [count] - The `count` parameter is an optional parameter that specifies the number of times the
-     * value should be inserted into the binary tree. If not provided, it defaults to 1.
-     * @returns The function `add` returns a `N` object if a new node is inserted, or `null` if no new node
-     * is inserted, or `undefined` if the insertion fails.
-     */
-    add(id: BinaryTreeNodeId, val: N['val'], count?: number): N | null | undefined;
-    /**
-     * The function inserts a new node into a binary tree as the left or right child of a given parent node.
-     * @param {N | null} newNode - The `newNode` parameter is an instance of the `BinaryTreeNode` class or
-     * `null`. It represents the node that needs to be inserted into the binary tree.
-     * @param parent - The `parent` parameter is a BinaryTreeNode object representing the parent node to which the new node
-     * will be inserted as a child.
-     * @returns The method returns the newly inserted node, either as the left child or the right child of the parent node.
-     */
-    addTo(newNode: N | null, parent: N): N | null | undefined;
-    /**
-     * The `addMany` function inserts multiple items into a binary tree and returns an array of the inserted nodes or
-     * null/undefined values.
-     * @param {N[] | N[]} data - The `data` parameter can be either an array of elements of type `N` or an
-     * array of `N` objects.
-     * @returns The function `addMany` returns an array of `N`, `null`, or `undefined` values.
-     */
-    addMany(data: N[] | Array<N['val']>): (N | null | undefined)[];
-    /**
-     * The `fill` function clears the current data and inserts new data, returning a boolean indicating if the insertion
-     * was successful.
-     * @param {N[] | N[]} data - The `data` parameter can be either an array of elements of type `N` or an
-     * array of `N` objects.
-     * @returns The method is returning a boolean value.
-     */
-    fill(data: N[] | Array<N['val']>): boolean;
-    /**
-     * The function removes a node from a binary tree and returns information about the deleted node.
-     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier of the binary tree node that you want to remove.
-     * It is of type `BinaryTreeNodeId`.
-     * @param {boolean} [ignoreCount] - The `ignoreCount` parameter is an optional boolean parameter that determines
-     * whether to ignore the count of the node being removed. If `ignoreCount` is set to `true`, the count of the node will
-     * not be decremented and the overall count of the binary tree will not be updated. If `
-     * @returns An array of objects is being returned. Each object in the array has two properties: "deleted" and
-     * "needBalanced". The "deleted" property contains the deleted node or undefined if no node was deleted. The
-     * "needBalanced" property is always null.
-     */
-    remove(id: BinaryTreeNodeId, ignoreCount?: boolean): BinaryTreeDeleted<N>[];
-    /**
-     * The function calculates the depth of a binary tree node by traversing its parent nodes.
-     * @param node - N - This is the node for which we want to calculate the depth. It is a generic type,
-     * meaning it can represent any type of data that we want to store in the node.
-     * @returns The depth of the given binary tree node.
-     */
-    getDepth(node: N): number;
-    /**
-     * The `getHeight` function calculates the maximum height of a binary tree using either a recursive or iterative
-     * approach.
-     * @param {N | null} [beginRoot] - The `beginRoot` parameter is an optional parameter of type
-     * `N | null`. It represents the starting node from which to calculate the height of the binary tree.
-     * If no value is provided for `beginRoot`, the function will use the `root` property of the class instance as
-     * @returns the height of the binary tree.
-     */
-    getHeight(beginRoot?: N | null): number;
-    /**
-     * The `getMinHeight` function calculates the minimum height of a binary tree using either a recursive or iterative
-     * approach.
-     * @param {N | null} [beginRoot] - The `beginRoot` parameter is an optional parameter of type
-     * `N | null`. It represents the starting node from which to calculate the minimum height of the binary
-     * tree. If no value is provided for `beginRoot`, the function will use the root node of the binary tree.
-     * @returns The function `getMinHeight` returns the minimum height of the binary tree.
-     */
-    getMinHeight(beginRoot?: N | null): number;
-    /**
-     * The function checks if a binary tree is balanced by comparing the minimum height and the maximum height of the tree.
-     * @param {N | null} [beginRoot] - The `beginRoot` parameter is the root node of a binary tree. It is
-     * of type `N | null`, which means it can either be a `BinaryTreeNode` object or `null`.
-     * @returns The method is returning a boolean value.
-     */
-    isBalanced(beginRoot?: N | null): boolean;
-    /**
-     * The function `getNodes` returns an array of binary tree nodes that match a given property value, with options for
-     * searching recursively or iteratively.
-     * @param {BinaryTreeNodeId | N} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or a
-     * generic type `N`. It represents the property of the binary tree node that you want to search for.
-     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-     * specifies the property name to use when searching for nodes. If not provided, it defaults to 'id'.
-     * @param {boolean} [onlyOne] - The `onlyOne` parameter is an optional boolean parameter that determines whether to
-     * return only one node that matches the `nodeProperty` or `propertyName` criteria. If `onlyOne` is set to `true`, the
-     * function will stop traversing the tree and return the first matching node. If `
-     * @returns The function `getNodes` returns an array of `N | null | undefined` objects.
-     */
-    getNodes(nodeProperty: BinaryTreeNodeId | N, propertyName?: BinaryTreeNodePropertyName, onlyOne?: boolean): (N | null | undefined)[];
-    /**
-     * The function checks if a binary tree node has a specific property or if any node in the tree has a specific
-     * property.
-     * @param {BinaryTreeNodeId | N} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or a
-     * generic type `N`. It represents the property of a binary tree node that you want to check.
-     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-     * specifies the name of the property to check for in the nodes.
-     * @returns a boolean value.
-     */
-    has(nodeProperty: BinaryTreeNodeId | N, propertyName?: BinaryTreeNodePropertyName): boolean;
-    /**
-     * The function returns the first binary tree node that matches the given property name and value, or null if no match
-     * is found.
-     * @param {BinaryTreeNodeId | N} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or a
-     * generic type `N`. It represents the property of the binary tree node that you want to search for.
-     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-     * specifies the property of the binary tree node to search for. If not provided, it defaults to `'id'`.
-     * @returns a BinaryTreeNode object or null.
-     */
-    get(nodeProperty: BinaryTreeNodeId | N, propertyName?: BinaryTreeNodePropertyName): N | null;
-    /**
-     * The function getPathToRoot returns an array of BinaryTreeNode objects representing the path from a given node to the
-     * root of a binary tree.
-     * @param node - The `node` parameter is a BinaryTreeNode object.
-     * @returns The function `getPathToRoot` returns an array of `N` objects, representing the path from
-     * the given `node` to the root of the binary tree.
-     */
-    getPathToRoot(node: N): N[];
-    getLeftMost(): N | null;
-    getLeftMost(node: N): N;
-    getRightMost(): N | null;
-    getRightMost(node: N): N;
-    /**
-     * The `isBST` function checks if a binary tree is a binary search tree.
-     * @param {N | null} [node] - The `node` parameter is an optional parameter of type `N
-     * | null`. It represents the root node of the binary search tree (BST) that we want to check for validity. If no node
-     * is provided, the function will default to using the root node of the BST instance that
-     * @returns The `isBST` function returns a boolean value. It returns `true` if the binary tree is a valid binary search
-     * tree, and `false` otherwise.
-     */
-    isBST(node?: N | null): boolean;
-    /**
-     * The function calculates the size and count of a subtree in a binary tree using either recursive or iterative
-     * traversal.
-     * @param {N | null | undefined} subTreeRoot - The `subTreeRoot` parameter is the root node of a binary
-     * tree.
-     * @returns The function `getSubTreeSizeAndCount` returns an array `[number, number]`. The first element of the array
-     * represents the size of the subtree, and the second element represents the count of the nodes in the subtree.
-     */
-    getSubTreeSizeAndCount(subTreeRoot: N | null | undefined): [number, number];
-    /**
-     * The function `subTreeSum` calculates the sum of a specified property in a binary tree, either recursively or
-     * iteratively.
-     * @param subTreeRoot - The subTreeRoot parameter is the root node of the subtree for which you want to calculate the
-     * sum.
-     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-     * specifies the property of the `BinaryTreeNode` object to use for calculating the sum. If `propertyName` is not
-     * provided, it defaults to `'val'`.
-     * @returns a number, which is the sum of the values of the nodes in the subtree rooted at `subTreeRoot`.
-     */
-    subTreeSum(subTreeRoot: N, propertyName?: BinaryTreeNodePropertyName): number;
-    /**
-     * The function `subTreeAdd` adds a specified delta value to a property of each node in a binary tree.
-     * @param subTreeRoot - The `subTreeRoot` parameter is the root node of the subtree where the values will be modified.
-     * @param {number} delta - The `delta` parameter is a number that represents the amount by which the property value of
-     * each node in the subtree should be increased or decreased.
-     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-     * specifies the property of the `BinaryTreeNode` that should be modified. It defaults to `'id'` if not provided.
-     * @returns a boolean value, which is `true`.
-     */
-    subTreeAdd(subTreeRoot: N, delta: number, propertyName?: BinaryTreeNodePropertyName): boolean;
-    BFS(): BinaryTreeNodeId[];
-    BFS(nodeOrPropertyName: 'id'): BinaryTreeNodeId[];
-    BFS(nodeOrPropertyName: 'val'): N['val'][];
-    BFS(nodeOrPropertyName: 'node'): N[];
-    BFS(nodeOrPropertyName: 'count'): number[];
-    DFS(): BinaryTreeNodeId[];
-    DFS(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'id'): BinaryTreeNodeId[];
-    DFS(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'val'): N[];
-    DFS(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'node'): N[];
-    DFS(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'count'): number[];
-    DFSIterative(): BinaryTreeNodeId[];
-    DFSIterative(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'id'): BinaryTreeNodeId[];
-    DFSIterative(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'val'): N[];
-    DFSIterative(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'node'): N[];
-    DFSIterative(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'count'): number[];
-    levelIterative(node: N | null): BinaryTreeNodeId[];
-    levelIterative(node: N | null, nodeOrPropertyName?: 'id'): BinaryTreeNodeId[];
-    levelIterative(node: N | null, nodeOrPropertyName?: 'val'): N['val'][];
-    levelIterative(node: N | null, nodeOrPropertyName?: 'node'): N[];
-    levelIterative(node: N | null, nodeOrPropertyName?: 'count'): number[];
-    listLevels(node: N | null): BinaryTreeNodeId[][];
-    listLevels(node: N | null, nodeOrPropertyName?: 'id'): BinaryTreeNodeId[][];
-    listLevels(node: N | null, nodeOrPropertyName?: 'val'): N['val'][][];
-    listLevels(node: N | null, nodeOrPropertyName?: 'node'): N[][];
-    listLevels(node: N | null, nodeOrPropertyName?: 'count'): number[][];
-    /**
-     * The function returns the predecessor of a given node in a binary tree.
-     * @param node - The parameter `node` is a BinaryTreeNode object, representing a node in a binary tree.
-     * @returns the predecessor of the given node in a binary tree.
-     */
-    getPredecessor(node: N): N;
-    morris(): BinaryTreeNodeId[];
-    morris(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'id'): BinaryTreeNodeId[];
-    morris(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'val'): N[];
-    morris(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'node'): N[];
-    morris(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'count'): number[];
-    protected _setLoopType(value: LoopType): void;
-    protected _setVisitedId(value: BinaryTreeNodeId[]): void;
-    protected _setVisitedVal(value: Array<N>): void;
-    protected _setVisitedNode(value: N[]): void;
-    protected setVisitedCount(value: number[]): void;
-    protected _setVisitedLeftSum(value: number[]): void;
-    protected _setAutoIncrementId(value: boolean): void;
-    protected _setMaxId(value: number): void;
-    protected _setIsDuplicatedVal(value: boolean): void;
-    protected _setRoot(v: N | null): void;
-    protected _setSize(v: number): void;
-    protected _setCount(v: number): void;
-    /**
-     * The function resets the values of several arrays used for tracking visited nodes and their properties.
-     */
-    protected _resetResults(): void;
-    /**
-     * The function checks if a given property of a binary tree node matches a specified value, and if so, adds the node to
-     * a result array.
-     * @param cur - The current binary tree node that is being checked.
-     * @param {(N | null | undefined)[]} result - An array that stores the matching nodes found during the
-     * traversal.
-     * @param {BinaryTreeNodeId | N} nodeProperty - The `nodeProperty` parameter is the value that we are searching for in
-     * the binary tree nodes. It can be either the `id`, `count`, or `val` property of the node.
-     * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-     * specifies the property of the `BinaryTreeNode` object that you want to compare with the `nodeProperty` value. It can
-     * be one of the following values: 'id', 'count', or 'val'. If no `propertyName` is provided,
-     * @param {boolean} [onlyOne] - The `onlyOne` parameter is an optional boolean parameter that determines whether to
-     * stop after finding the first matching node or continue searching for all matching nodes. If `onlyOne` is set to
-     * `true`, the function will stop after finding the first matching node and return `true`. If `onlyOne
-     * @returns a boolean value indicating whether or not a node was pushed into the result array.
-     */
-    protected _pushByPropertyNameStopOrNot(cur: N, result: (N | null | undefined)[], nodeProperty: BinaryTreeNodeId | N, propertyName?: BinaryTreeNodePropertyName, onlyOne?: boolean): boolean | undefined;
-    /**
-     * The function `_accumulatedByPropertyName` pushes a property value of a binary tree node into an array based on the
-     * provided property name or a default property name.
-     * @param node - The `node` parameter is of type `N`, which represents a node in a binary tree.
-     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The parameter `nodeOrPropertyName` is an optional parameter that
-     * can be either a string representing a property name or a reference to a node object. If it is a string, it specifies
-     * the property name of the node that should be accumulated. If it is a node object, it specifies the node itself
-     */
-    protected _accumulatedByPropertyName(node: N, nodeOrPropertyName?: NodeOrPropertyName): void;
-    /**
-     * The function `_getResultByPropertyName` returns different results based on the provided property name or defaulting
-     * to 'id'.
-     * @param {NodeOrPropertyName} [nodeOrPropertyName] - The parameter `nodeOrPropertyName` is an optional parameter that
-     * can accept a value of type `NodeOrPropertyName`.
-     * @returns The method returns an object of type `ResultsByProperty<T>`.
-     */
-    protected _getResultByPropertyName(nodeOrPropertyName?: NodeOrPropertyName): ResultsByProperty<N>;
+    createNode(id: BinaryTreeNodeId, val?: N['val'], count?: number): N;
 }