graph-typed 1.47.5 → 1.47.6

package/dist/data-structures/heap/heap.d.ts

@@ -5,15 +5,12 @@
  * @license MIT License
  */
 import type { Comparator, DFSOrderPattern } from '../../types';
+import { HeapOptions } from "../../types";
 export declare class Heap<E = any> {
-    constructor(options: {
-        comparator: Comparator<E>;
-        elements?: E[];
-    });
+    options: HeapOptions<E>;
+    constructor(elements?: Iterable<E>, options?: HeapOptions<E>);
     protected _elements: E[];
     get elements(): E[];
-    protected _comparator: Comparator<E>;
-    get comparator(): Comparator<E>;
     /**
      * Get the size (number of elements) of the heap.
      */
@@ -26,10 +23,10 @@ export declare class Heap<E = any> {
     /**
      * Static method that creates a binary heap from an array of elements and a comparison function.
      * @returns A new Heap instance.
+     * @param elements
      * @param options
      */
-    static heapify<E>(options: {
-        elements: E[];
+    static heapify<E>(elements: Iterable<E>, options: {
         comparator: Comparator<E>;
     }): Heap<E>;
     /**
@@ -204,6 +201,11 @@ export declare class Heap<E = any> {
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      */
+    print(): void;
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -212,10 +214,6 @@ export declare class Heap<E = any> {
      * @param index - The index of the newly added element.
      */
     protected _bubbleUp(index: number): void;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -349,18 +347,18 @@ export declare class FibonacciHeap<E> {
      */
     merge(heapToMerge: FibonacciHeap<E>): void;
     /**
-     * Default comparator function used by the heap.
-     * @param {E} a
-     * @param {E} b
+     * Create a new node.
+     * @param element
      * @protected
      */
-    protected defaultComparator(a: E, b: E): number;
+    createNode(element: E): FibonacciHeapNode<E>;
     /**
-     * Create a new node.
-     * @param element
+     * Default comparator function used by the heap.
+     * @param {E} a
+     * @param {E} b
      * @protected
      */
-    protected createNode(element: E): FibonacciHeapNode<E>;
+    protected _defaultComparator(a: E, b: E): number;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -399,7 +397,7 @@ export declare class FibonacciHeap<E> {
      * @param x
      * @protected
      */
-    protected link(y: FibonacciHeapNode<E>, x: FibonacciHeapNode<E>): void;
+    protected _link(y: FibonacciHeapNode<E>, x: FibonacciHeapNode<E>): void;
     /**
      * Time Complexity: O(n log n), where n is the number of elements in the heap.
      * Space Complexity: O(n)
@@ -411,5 +409,5 @@ export declare class FibonacciHeap<E> {
      * Remove and return the top element (smallest or largest element) from the heap.
      * @protected
      */
-    protected consolidate(): void;
+    protected _consolidate(): void;
 }

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

@@ -8,20 +8,34 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.FibonacciHeap = exports.FibonacciHeapNode = exports.Heap = void 0;
 class Heap {
-    constructor(options) {
+    constructor(elements, options) {
         this._elements = [];
-        this._comparator = options.comparator;
-        if (options.elements && options.elements.length > 0) {
-            this._elements = options.elements;
-            this.fix();
+        const defaultComparator = (a, b) => {
+            if (!(typeof a === 'number' && typeof b === 'number')) {
+                throw new Error('The a, b params of compare function must be number');
+            }
+            else {
+                return a - b;
+            }
+        };
+        if (options) {
+            this.options = options;
+        }
+        else {
+            this.options = {
+                comparator: defaultComparator
+            };
+        }
+        if (elements) {
+            for (const el of elements) {
+                this.push(el);
+            }
+            // this.fix();
         }
     }
     get elements() {
         return this._elements;
     }
-    get comparator() {
-        return this._comparator;
-    }
     /**
      * Get the size (number of elements) of the heap.
      */
@@ -39,10 +53,11 @@ class Heap {
     /**
      * Static method that creates a binary heap from an array of elements and a comparison function.
      * @returns A new Heap instance.
+     * @param elements
      * @param options
      */
-    static heapify(options) {
-        return new Heap(options);
+    static heapify(elements, options) {
+        return new Heap(elements, options);
     }
     /**
      * Time Complexity: O(log n), where n is the number of elements in the heap.
@@ -256,7 +271,7 @@ class Heap {
      * @returns A new Heap instance containing the same elements.
      */
     clone() {
-        const clonedHeap = new Heap({ comparator: this.comparator });
+        const clonedHeap = new Heap([], this.options);
         clonedHeap._elements = [...this.elements];
         return clonedHeap;
     }
@@ -308,7 +323,7 @@ class Heap {
         }
     }
     filter(predicate) {
-        const filteredHeap = new Heap({ comparator: this.comparator });
+        const filteredHeap = new Heap([], this.options);
         let index = 0;
         for (const el of this) {
             if (predicate(el, index, this)) {
@@ -319,7 +334,7 @@ class Heap {
         return filteredHeap;
     }
     map(callback, comparator) {
-        const mappedHeap = new Heap({ comparator: comparator });
+        const mappedHeap = new Heap([], { comparator: comparator });
         let index = 0;
         for (const el of this) {
             mappedHeap.add(callback(el, index, this));
@@ -340,6 +355,13 @@ class Heap {
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      */
+    print() {
+        console.log([...this]);
+    }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -352,17 +374,13 @@ class Heap {
         while (index > 0) {
             const parent = (index - 1) >> 1;
             const parentItem = this.elements[parent];
-            if (this._comparator(parentItem, element) <= 0)
+            if (this.options.comparator(parentItem, element) <= 0)
                 break;
             this.elements[index] = parentItem;
             index = parent;
         }
         this.elements[index] = element;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -378,11 +396,11 @@ class Heap {
             const right = left + 1;
             let minItem = this.elements[left];
             if (right < this.elements.length &&
-                this._comparator(minItem, this.elements[right]) > 0) {
+                this.options.comparator(minItem, this.elements[right]) > 0) {
                 left = right;
                 minItem = this.elements[right];
             }
-            if (this._comparator(minItem, element) >= 0)
+            if (this.options.comparator(minItem, element) >= 0)
                 break;
             this.elements[index] = minItem;
             index = left;
@@ -403,7 +421,7 @@ class FibonacciHeap {
     constructor(comparator) {
         this._size = 0;
         this.clear();
-        this._comparator = comparator || this.defaultComparator;
+        this._comparator = comparator || this._defaultComparator;
         if (typeof this.comparator !== 'function') {
             throw new Error('FibonacciHeap constructor: given comparator should be a function.');
         }
@@ -574,7 +592,7 @@ class FibonacciHeap {
         }
         else {
             this._min = z.right;
-            this.consolidate();
+            this._consolidate();
         }
         this._size--;
         return z.element;
@@ -614,27 +632,27 @@ class FibonacciHeap {
         // Clear the heap that was merged
         heapToMerge.clear();
     }
+    /**
+     * Create a new node.
+     * @param element
+     * @protected
+     */
+    createNode(element) {
+        return new FibonacciHeapNode(element);
+    }
     /**
      * Default comparator function used by the heap.
      * @param {E} a
      * @param {E} b
      * @protected
      */
-    defaultComparator(a, b) {
+    _defaultComparator(a, b) {
         if (a < b)
             return -1;
         if (a > b)
             return 1;
         return 0;
     }
-    /**
-     * Create a new node.
-     * @param element
-     * @protected
-     */
-    createNode(element) {
-        return new FibonacciHeapNode(element);
-    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -690,7 +708,7 @@ class FibonacciHeap {
      * @param x
      * @protected
      */
-    link(y, x) {
+    _link(y, x) {
         this.removeFromRoot(y);
         y.left = y;
         y.right = y;
@@ -709,7 +727,7 @@ class FibonacciHeap {
      * Remove and return the top element (smallest or largest element) from the heap.
      * @protected
      */
-    consolidate() {
+    _consolidate() {
         const A = new Array(this.size);
         const elements = this.consumeLinkedList(this.root);
         let x, y, d, t;
@@ -723,7 +741,7 @@ class FibonacciHeap {
                     x = y;
                     y = t;
                 }
-                this.link(y, x);
+                this._link(y, x);
                 A[d] = undefined;
                 d++;
             }

package/dist/data-structures/heap/max-heap.d.ts

@@ -6,10 +6,7 @@
  * @license MIT License
  */
 import { Heap } from './heap';
-import type { Comparator } from '../../types';
+import type { HeapOptions } from '../../types';
 export declare class MaxHeap<E = any> extends Heap<E> {
-    constructor(options?: {
-        comparator: Comparator<E>;
-        nodes?: E[];
-    });
+    constructor(elements?: Iterable<E>, options?: HeapOptions<E>);
 }

package/dist/data-structures/heap/max-heap.js

@@ -10,7 +10,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.MaxHeap = void 0;
 const heap_1 = require("./heap");
 class MaxHeap extends heap_1.Heap {
-    constructor(options = {
+    constructor(elements, options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
                 throw new Error('The a, b params of compare function must be number');
@@ -20,7 +20,7 @@ class MaxHeap extends heap_1.Heap {
             }
         }
     }) {
-        super(options);
+        super(elements, options);
     }
 }
 exports.MaxHeap = MaxHeap;

package/dist/data-structures/heap/min-heap.d.ts

@@ -6,10 +6,7 @@
  * @license MIT License
  */
 import { Heap } from './heap';
-import type { Comparator } from '../../types';
+import type { HeapOptions } from '../../types';
 export declare class MinHeap<E = any> extends Heap<E> {
-    constructor(options?: {
-        comparator: Comparator<E>;
-        nodes?: E[];
-    });
+    constructor(elements?: Iterable<E>, options?: HeapOptions<E>);
 }

package/dist/data-structures/heap/min-heap.js

@@ -10,7 +10,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.MinHeap = void 0;
 const heap_1 = require("./heap");
 class MinHeap extends heap_1.Heap {
-    constructor(options = {
+    constructor(elements, options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
                 throw new Error('The a, b params of compare function must be number');
@@ -20,7 +20,7 @@ class MinHeap extends heap_1.Heap {
             }
         }
     }) {
-        super(options);
+        super(elements, options);
     }
 }
 exports.MinHeap = MinHeap;

package/dist/data-structures/linked-list/doubly-linked-list.d.ts

@@ -20,7 +20,7 @@ export declare class DoublyLinkedList<E = any> {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
-    constructor();
+    constructor(elements?: Iterable<E>);
     protected _head: DoublyLinkedListNode<E> | null;
     get head(): DoublyLinkedListNode<E> | null;
     protected _tail: DoublyLinkedListNode<E> | null;
@@ -453,4 +453,5 @@ export declare class DoublyLinkedList<E = any> {
      * elements in the linked list.
      */
     reduce<T>(callback: (accumulator: T, value: E, index: number, list: DoublyLinkedList<E>) => T, initialValue: T): T;
+    print(): void;
 }

package/dist/data-structures/linked-list/doubly-linked-list.js

@@ -25,10 +25,15 @@ class DoublyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
-    constructor() {
+    constructor(elements) {
         this._head = null;
         this._tail = null;
         this._length = 0;
+        if (elements) {
+            for (const el of elements) {
+                this.push(el);
+            }
+        }
     }
     get head() {
         return this._head;
@@ -766,5 +771,8 @@ class DoublyLinkedList {
         }
         return accumulator;
     }
+    print() {
+        console.log([...this]);
+    }
 }
 exports.DoublyLinkedList = DoublyLinkedList;

package/dist/data-structures/linked-list/singly-linked-list.d.ts

@@ -19,7 +19,7 @@ export declare class SinglyLinkedList<E = any> {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
-    constructor();
+    constructor(elements?: Iterable<E>);
     protected _head: SinglyLinkedListNode<E> | null;
     get head(): SinglyLinkedListNode<E> | null;
     protected _tail: SinglyLinkedListNode<E> | null;
@@ -411,4 +411,5 @@ export declare class SinglyLinkedList<E = any> {
      * elements in the linked list.
      */
     reduce<T>(callback: (accumulator: T, value: E, index: number, list: SinglyLinkedList<E>) => T, initialValue: T): T;
+    print(): void;
 }

package/dist/data-structures/linked-list/singly-linked-list.js

@@ -24,10 +24,14 @@ class SinglyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
-    constructor() {
+    constructor(elements) {
         this._head = null;
         this._tail = null;
         this._length = 0;
+        if (elements) {
+            for (const el of elements)
+                this.push(el);
+        }
     }
     get head() {
         return this._head;
@@ -709,5 +713,8 @@ class SinglyLinkedList {
         }
         return accumulator;
     }
+    print() {
+        console.log([...this]);
+    }
 }
 exports.SinglyLinkedList = SinglyLinkedList;

package/dist/data-structures/priority-queue/max-priority-queue.d.ts

@@ -6,10 +6,7 @@
  * @license MIT License
  */
 import { PriorityQueue } from './priority-queue';
-import type { Comparator } from '../../types';
+import type { PriorityQueueOptions } from '../../types';
 export declare class MaxPriorityQueue<E = any> extends PriorityQueue<E> {
-    constructor(options?: {
-        comparator: Comparator<E>;
-        nodes?: E[];
-    });
+    constructor(elements?: Iterable<E>, options?: PriorityQueueOptions<E>);
 }

package/dist/data-structures/priority-queue/max-priority-queue.js

@@ -10,7 +10,7 @@ exports.MaxPriorityQueue = void 0;
  */
 const priority_queue_1 = require("./priority-queue");
 class MaxPriorityQueue extends priority_queue_1.PriorityQueue {
-    constructor(options = {
+    constructor(elements, options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
                 throw new Error('The a, b params of compare function must be number');
@@ -20,7 +20,7 @@ class MaxPriorityQueue extends priority_queue_1.PriorityQueue {
             }
         }
     }) {
-        super(options);
+        super(elements, options);
     }
 }
 exports.MaxPriorityQueue = MaxPriorityQueue;

package/dist/data-structures/priority-queue/min-priority-queue.d.ts

@@ -6,10 +6,7 @@
  * @license MIT License
  */
 import { PriorityQueue } from './priority-queue';
-import type { Comparator } from '../../types';
+import type { PriorityQueueOptions } from '../../types';
 export declare class MinPriorityQueue<E = any> extends PriorityQueue<E> {
-    constructor(options?: {
-        comparator: Comparator<E>;
-        nodes?: E[];
-    });
+    constructor(elements?: Iterable<E>, options?: PriorityQueueOptions<E>);
 }

package/dist/data-structures/priority-queue/min-priority-queue.js

@@ -10,7 +10,7 @@ exports.MinPriorityQueue = void 0;
  */
 const priority_queue_1 = require("./priority-queue");
 class MinPriorityQueue extends priority_queue_1.PriorityQueue {
-    constructor(options = {
+    constructor(elements, options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
                 throw new Error('The a, b params of compare function must be number');
@@ -20,7 +20,7 @@ class MinPriorityQueue extends priority_queue_1.PriorityQueue {
             }
         }
     }) {
-        super(options);
+        super(elements, options);
     }
 }
 exports.MinPriorityQueue = MinPriorityQueue;

package/dist/data-structures/priority-queue/priority-queue.d.ts

@@ -6,10 +6,7 @@
  * @license MIT License
  */
 import { Heap } from '../heap';
-import { Comparator } from '../../types';
+import { PriorityQueueOptions } from '../../types';
 export declare class PriorityQueue<E = any> extends Heap<E> {
-    constructor(options: {
-        comparator: Comparator<E>;
-        nodes?: E[];
-    });
+    constructor(elements?: Iterable<E>, options?: PriorityQueueOptions<E>);
 }

package/dist/data-structures/priority-queue/priority-queue.js

@@ -10,8 +10,8 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.PriorityQueue = void 0;
 const heap_1 = require("../heap");
 class PriorityQueue extends heap_1.Heap {
-    constructor(options) {
-        super(options);
+    constructor(elements, options) {
+        super(elements, options);
     }
 }
 exports.PriorityQueue = PriorityQueue;

package/dist/data-structures/queue/deque.d.ts

@@ -428,6 +428,7 @@ export declare class Deque<E> {
      * applying the callback function to each element.
      */
     reduce<T>(callback: (accumulator: T, element: E, index: number, deque: this) => T, initialValue: T): T;
+    print(): void;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)

package/dist/data-structures/queue/deque.js

@@ -761,6 +761,9 @@ class Deque {
         }
         return accumulator;
     }
+    print() {
+        console.log([...this]);
+    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)

package/dist/data-structures/queue/queue.d.ts

@@ -205,6 +205,7 @@ export declare class Queue<E = any> {
      * @returns The `clone()` method is returning a new instance of the `Queue` class.
      */
     clone(): Queue<E>;
+    print(): void;
     [Symbol.iterator](): Generator<E, void, unknown>;
     /**
      * Time Complexity: O(n)

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

@@ -265,6 +265,9 @@ class Queue {
     clone() {
         return new Queue(this.nodes.slice(this.offset));
     }
+    print() {
+        console.log([...this]);
+    }
     *[Symbol.iterator]() {
         for (const item of this.nodes) {
             yield item;

package/dist/data-structures/stack/stack.d.ts

@@ -10,7 +10,7 @@ export declare class Stack<E = any> {
      * of elements of type `E`. It is used to initialize the `_elements` property of the class. If the `elements` parameter
      * is provided and is an array, it is assigned to the `_elements
      */
-    constructor(elements?: E[]);
+    constructor(elements?: Iterable<E>);
     protected _elements: E[];
     get elements(): E[];
     /**
@@ -116,4 +116,5 @@ export declare class Stack<E = any> {
     filter(predicate: (element: E, index: number, stack: this) => boolean): Stack<E>;
     map<T>(callback: (element: E, index: number, stack: this) => T): Stack<T>;
     reduce<T>(callback: (accumulator: T, element: E, index: number, stack: this) => T, initialValue: T): T;
+    print(): void;
 }

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

@@ -14,7 +14,12 @@ class Stack {
      * is provided and is an array, it is assigned to the `_elements
      */
     constructor(elements) {
-        this._elements = Array.isArray(elements) ? elements : [];
+        this._elements = [];
+        if (elements) {
+            for (const el of elements) {
+                this.push(el);
+            }
+        }
     }
     get elements() {
         return this._elements;
@@ -137,7 +142,7 @@ class Stack {
      * @returns An iterator object.
      */
     *[Symbol.iterator]() {
-        for (let i = this.elements.length - 1; i >= 0; i--) {
+        for (let i = 0; i < this.elements.length; i++) {
             yield this.elements[i];
         }
     }
@@ -181,5 +186,8 @@ class Stack {
         }
         return accumulator;
     }
+    print() {
+        console.log([...this]);
+    }
 }
 exports.Stack = Stack;

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

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

package/dist/types/common.d.ts

@@ -1,3 +1,4 @@
+import { BTNKey } from "./data-structures";
 export type Comparator<T> = (a: T, b: T) => number;
 export type DFSOrderPattern = 'pre' | 'in' | 'post';
 export type BTNCallback<N, D = any> = (node: N) => D;
@@ -18,3 +19,4 @@ export type BinaryTreePrintOptions = {
     isShowNull?: boolean;
     isShowRedBlackNIL?: boolean;
 };
+export type IterableEntriesOrKeys<T> = Iterable<[BTNKey, T | undefined] | BTNKey>;

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

@@ -26,6 +26,6 @@ export type BiTreeDeleteResult<N> = {
 export type BinaryTreeNodeNested<T> = BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BinaryTreeNested<T, N extends BinaryTreeNode<T, N>> = BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, BinaryTree<T, N, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BinaryTreeOptions = {
-    iterationType?: IterationType;
+    iterationType: IterationType;
 };
 export type NodeDisplayLayout = [string[], number, number, number];