data-structure-typed 0.9.16 → 1.3.1

package/package.json

@@ -1,54 +1,165 @@
 {
   "name": "data-structure-typed",
-  "version": "0.9.16",
-  "description": "Hash (CoordinateSet, CoordinateMap) Heap (MaxHeap, MinHeap) Binary Tree (AVL Tree, Binary Indexed Tree, Binary Search Tree, Segment Tree, Tree Multiset) Graph (Directed Graph, Undirected Graph) Linked List (Singly Linked List, Doubly Linked List) Matrix Priority Queue (Max Priority Queue, Min Priority Queue) Queue (Queue, Dequeue) Stack Trie",
+  "version": "1.3.1",
+  "description": "Data Structures of Javascript & TypeScript. AVLTree, Binary Search Tree, Binary Tree, Tree Multiset, Graph, Heap, Priority Queue, Linked List.",
   "main": "dist/index.js",
+  "module": "dist/index.js",
+  "types": "dist/index.d.ts",
   "scripts": {
-    "build": "rm -rf dist && npx tsc",
-    "test": "echo \"Error: no test specified\" && exit 1"
+    "build": "rm -rf dist && npx tsc && npm run build:browser",
+    "build:browser": "webpack",
+    "build:docs": "typedoc --out docs ./src",
+    "test": "jest",
+    "update:test-deps": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multiset-typed trie-typed undirected-graph-typed --save-dev",
+    "deps:check": "dependency-cruiser src",
+    "build:publish": "npm run test && npm run build && npm run build:docs && npm publish"
   },
   "repository": {
     "type": "git",
     "url": "git+https://github.com/zrwusa/data-structure-typed.git"
   },
   "keywords": [
+    "data structure",
+    "Data Structure",
+    "data-structure",
+    "data structures",
+    "Data Structures",
+    "data-structures",
+    "algorithm",
+    "binary search tree",
+    "Binary Search Tree",
+    "binary-search-tree",
+    "binary tree",
     "Binary Tree",
+    "binary-tree",
+    "bst",
+    "BST",
     "AVL Tree",
-    "Binary Search Tree (BST)",
+    "avl tree",
+    "avl-tree",
+    "avl",
+    "tree multiset",
     "Tree Multiset",
-    "Segment Tree",
-    "Binary Indexed Tree",
+    "tree-multiset",
+    "Tree Multiset",
+    "dfs",
+    "DFS",
+    "dfs iterative",
+    "DFS Iterative",
+    "bfs",
+    "BFS",
+    "graph",
     "Graph",
+    "directed graph",
     "Directed Graph",
+    "directed-graph",
+    "undirected graph",
     "Undirected Graph",
-    "Singly Linked List",
-    "Hash",
-    "CoordinateSet",
-    "CoordinateMap",
+    "undirected-graph",
+    "heap",
     "Heap",
-    "Doubly Linked List",
+    "priority queue",
     "Priority Queue",
+    "priority-queue",
+    "max priority queue",
     "Max Priority Queue",
+    "max-priority-queue",
+    "min priority queue",
     "Min Priority Queue",
+    "min-priority-queue",
+    "deque",
+    "Deque",
+    "linked list",
+    "Linked List",
+    "linked-list",
+    "trie",
+    "Trie",
+    "prefix tree",
+    "Prefix Tree",
+    "prefix-tree",
+    "binary",
+    "DataStructure",
+    "DataStructures",
+    "data",
+    "structure",
+    "sort",
+    "segment tree",
+    "Segment Tree",
+    "segment-tree",
+    "binary indexed tree",
+    "Binary Indexed Tree",
+    "binary-indexed-tree",
+    "linked list",
+    "Linked List",
+    "linked-list",
+    "singly linked list",
+    "Singly Linked List",
+    "singly-linked-list",
+    "doubly linked list",
+    "Doubly Linked List",
+    "doubly-linked-list",
+    "queue",
+    "array queue",
+    "Array Queue",
+    "array-queue",
     "Queue",
-    "ObjectDeque",
-    "ArrayDeque",
+    "object deque",
+    "Object Deque",
+    "array deque",
+    "Array Deque",
+    "stack",
     "Stack",
-    "Trie"
+    "hash",
+    "Hash",
+    "morris",
+    "Morris",
+    "bellman ford",
+    "Bellman Ford",
+    "bellman-ford",
+    "dijkstra",
+    "Dijkstra",
+    "floyd warshall",
+    "Floyd Warshall",
+    "floyd-warshall",
+    "Tarjan",
+    "tarjan",
+    "Tarjan's"
   ],
-  "author": "Tyler Zeng",
-  "license": "ISC",
+  "author": "Tyler Zeng zrwusa@gmail.com",
+  "license": "MIT",
   "bugs": {
     "url": "https://github.com/zrwusa/data-structure-typed/issues"
   },
   "homepage": "https://github.com/zrwusa/data-structure-typed#readme",
-  "types": "dist/index.d.ts",
   "devDependencies": {
-    "@types/lodash": "^4.14.197",
+    "@types/jest": "^29.5.3",
     "@types/node": "^20.4.9",
-    "typescript": "^4.6.2"
-  },
-  "dependencies": {
-    "lodash": "^4.17.21"
+    "avl-tree-typed": "^1.21.3",
+    "binary-tree-typed": "^1.21.3",
+    "bst-typed": "^1.21.3",
+    "dependency-cruiser": "^13.1.2",
+    "deque-typed": "^1.21.3",
+    "directed-graph-typed": "^1.21.3",
+    "doubly-linked-list-typed": "^1.21.3",
+    "graph-typed": "^1.21.3",
+    "heap-typed": "^1.21.3",
+    "jest": "^29.6.2",
+    "linked-list-typed": "^1.21.3",
+    "max-heap-typed": "^1.21.3",
+    "max-priority-queue-typed": "^1.21.3",
+    "min-heap-typed": "^1.21.3",
+    "min-priority-queue-typed": "^1.21.3",
+    "priority-queue-typed": "^1.21.3",
+    "singly-linked-list-typed": "^1.21.3",
+    "stack-typed": "^1.21.3",
+    "tree-multiset-typed": "^1.21.3",
+    "trie-typed": "^1.21.3",
+    "ts-jest": "^29.1.1",
+    "ts-loader": "^9.4.4",
+    "typedoc": "^0.24.8",
+    "typescript": "^4.9.5",
+    "undirected-graph-typed": "^1.21.3",
+    "webpack": "^5.88.2",
+    "webpack-cli": "^5.1.4"
   }
 }

package/.idea/data-structure-typed.iml

@@ -1,12 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<module type="WEB_MODULE" version="4">
-  <component name="NewModuleRootManager">
-    <content url="file://$MODULE_DIR$">
-      <excludeFolder url="file://$MODULE_DIR$/temp" />
-      <excludeFolder url="file://$MODULE_DIR$/.tmp" />
-      <excludeFolder url="file://$MODULE_DIR$/tmp" />
-    </content>
-    <orderEntry type="inheritedJdk" />
-    <orderEntry type="sourceFolder" forTests="false" />
-  </component>
-</module>

package/.idea/modules.xml

@@ -1,8 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="ProjectModuleManager">
-    <modules>
-      <module fileurl="file://$PROJECT_DIR$/.idea/data-structure-typed.iml" filepath="$PROJECT_DIR$/.idea/data-structure-typed.iml" />
-    </modules>
-  </component>
-</project>

package/.idea/vcs.xml

@@ -1,6 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="VcsDirectoryMappings">
-    <mapping directory="$PROJECT_DIR$" vcs="Git" />
-  </component>
-</project>

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

@@ -1,16 +0,0 @@
-export declare const THUNK_SYMBOL: unique symbol;
-export declare const isThunk: (fnOrValue: any) => boolean;
-type ToThunkFn = () => ReturnType<TrlFn>;
-type Thunk = () => ReturnType<ToThunkFn> & {
-    __THUNK__: typeof THUNK_SYMBOL;
-};
-export declare const toThunk: (fn: ToThunkFn) => Thunk;
-type TrlFn = (...args: any[]) => any;
-export declare const trampoline: (fn: TrlFn) => ((...args: [...Parameters<TrlFn>]) => any) & {
-    cont: (...args: [...Parameters<TrlFn>]) => Thunk;
-};
-type TrlAsyncFn = (...args: any[]) => any;
-export declare const trampolineAsync: (fn: TrlAsyncFn) => ((...args: [...Parameters<TrlAsyncFn>]) => Promise<any>) & {
-    cont: (...args: [...Parameters<TrlAsyncFn>]) => Thunk;
-};
-export {};

package/dist/data-structures/trampoline.js

@@ -1,130 +0,0 @@
-"use strict";
-var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
-    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
-    return new (P || (P = Promise))(function (resolve, reject) {
-        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
-        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
-        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
-        step((generator = generator.apply(thisArg, _arguments || [])).next());
-    });
-};
-var __generator = (this && this.__generator) || function (thisArg, body) {
-    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
-    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
-    function verb(n) { return function (v) { return step([n, v]); }; }
-    function step(op) {
-        if (f) throw new TypeError("Generator is already executing.");
-        while (g && (g = 0, op[0] && (_ = 0)), _) try {
-            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
-            if (y = 0, t) op = [op[0] & 2, t.value];
-            switch (op[0]) {
-                case 0: case 1: t = op; break;
-                case 4: _.label++; return { value: op[1], done: false };
-                case 5: _.label++; y = op[1]; op = [0]; continue;
-                case 7: op = _.ops.pop(); _.trys.pop(); continue;
-                default:
-                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
-                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
-                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
-                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
-                    if (t[2]) _.ops.pop();
-                    _.trys.pop(); continue;
-            }
-            op = body.call(thisArg, _);
-        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
-        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
-    }
-};
-var __read = (this && this.__read) || function (o, n) {
-    var m = typeof Symbol === "function" && o[Symbol.iterator];
-    if (!m) return o;
-    var i = m.call(o), r, ar = [], e;
-    try {
-        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
-    }
-    catch (error) { e = { error: error }; }
-    finally {
-        try {
-            if (r && !r.done && (m = i["return"])) m.call(i);
-        }
-        finally { if (e) throw e.error; }
-    }
-    return ar;
-};
-var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
-    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
-        if (ar || !(i in from)) {
-            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
-            ar[i] = from[i];
-        }
-    }
-    return to.concat(ar || Array.prototype.slice.call(from));
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.trampolineAsync = exports.trampoline = exports.toThunk = exports.isThunk = exports.THUNK_SYMBOL = void 0;
-exports.THUNK_SYMBOL = Symbol('thunk');
-var isThunk = function (fnOrValue) {
-    return typeof fnOrValue === 'function' && fnOrValue.__THUNK__ === exports.THUNK_SYMBOL;
-};
-exports.isThunk = isThunk;
-var toThunk = function (fn) {
-    var thunk = function () { return fn(); };
-    thunk.__THUNK__ = exports.THUNK_SYMBOL;
-    return thunk;
-};
-exports.toThunk = toThunk;
-var trampoline = function (fn) {
-    var cont = function () {
-        var args = [];
-        for (var _i = 0; _i < arguments.length; _i++) {
-            args[_i] = arguments[_i];
-        }
-        return (0, exports.toThunk)(function () { return fn.apply(void 0, __spreadArray([], __read(args), false)); });
-    };
-    return Object.assign(function () {
-        var args = [];
-        for (var _i = 0; _i < arguments.length; _i++) {
-            args[_i] = arguments[_i];
-        }
-        var result = fn.apply(void 0, __spreadArray([], __read(args), false));
-        while ((0, exports.isThunk)(result) && typeof result === 'function') {
-            result = result();
-        }
-        return result;
-    }, { cont: cont });
-};
-exports.trampoline = trampoline;
-var trampolineAsync = function (fn) {
-    var cont = function () {
-        var args = [];
-        for (var _i = 0; _i < arguments.length; _i++) {
-            args[_i] = arguments[_i];
-        }
-        return (0, exports.toThunk)(function () { return fn.apply(void 0, __spreadArray([], __read(args), false)); });
-    };
-    return Object.assign(function () {
-        var args = [];
-        for (var _i = 0; _i < arguments.length; _i++) {
-            args[_i] = arguments[_i];
-        }
-        return __awaiter(void 0, void 0, void 0, function () {
-            var result;
-            return __generator(this, function (_a) {
-                switch (_a.label) {
-                    case 0: return [4 /*yield*/, fn.apply(void 0, __spreadArray([], __read(args), false))];
-                    case 1:
-                        result = _a.sent();
-                        _a.label = 2;
-                    case 2:
-                        if (!((0, exports.isThunk)(result) && typeof result === 'function')) return [3 /*break*/, 4];
-                        return [4 /*yield*/, result()];
-                    case 3:
-                        result = _a.sent();
-                        return [3 /*break*/, 2];
-                    case 4: return [2 /*return*/, result];
-                }
-            });
-        });
-    }, { cont: cont });
-};
-exports.trampolineAsync = trampolineAsync;

package/dist/data-structures/types/abstract-graph.d.ts

@@ -1,29 +0,0 @@
-export type VertexId = string | number;
-export type DijkstraResult<V> = {
-    distMap: Map<V, number>;
-    preMap: Map<V, V | null>;
-    seen: Set<V>;
-    paths: V[][];
-    minDist: number;
-    minPath: V[];
-} | null;
-export interface IGraph<V, E> {
-    containsVertex(vertexOrId: V | VertexId): boolean;
-    getVertex(vertexOrId: VertexId | V): V | null;
-    getVertexId(vertexOrId: V | VertexId): VertexId;
-    vertexSet(): Map<VertexId, V>;
-    addVertex(v: V): boolean;
-    removeVertex(vertexOrId: V | VertexId): boolean;
-    removeAllVertices(vertices: V[] | VertexId[]): boolean;
-    degreeOf(vertexOrId: V | VertexId): number;
-    edgesOf(vertexOrId: V | VertexId): E[];
-    containsEdge(src: V | VertexId, dest: V | VertexId): boolean;
-    getEdge(srcOrId: V | VertexId, destOrId: V | VertexId): E | null;
-    edgeSet(): E[];
-    addEdge(edge: E): boolean;
-    removeEdgeBetween(srcOrId: V | VertexId, destOrId: V | VertexId): E | null;
-    removeEdge(edge: E): E | null;
-    setEdgeWeight(srcOrId: V | VertexId, destOrId: V | VertexId, weight: number): boolean;
-    getMinPathBetween(v1: V | VertexId, v2: V | VertexId, isWeight?: boolean): V[] | null;
-    getNeighbors(vertexOrId: V | VertexId): V[];
-}

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

@@ -1,5 +0,0 @@
-import { AVLTreeNode } from "../binary-tree";
-export interface AVLTreeDeleted<T> {
-    deleted: AVLTreeNode<T> | null;
-    needBalanced: AVLTreeNode<T> | null;
-}

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

@@ -1,16 +0,0 @@
-import { BinaryTreeNode } from "../binary-tree";
-export type BinaryTreeNodePropertyName = 'id' | 'val' | 'count';
-export type NodeOrPropertyName = 'node' | BinaryTreeNodePropertyName;
-export type DFSOrderPattern = 'in' | 'pre' | 'post';
-export type BinaryTreeNodeId = number;
-export type BinaryTreeDeleted<T> = {
-    deleted: BinaryTreeNode<T> | null | undefined;
-    needBalanced: BinaryTreeNode<T> | null;
-};
-export type ResultByProperty<T> = T | BinaryTreeNode<T> | number | BinaryTreeNodeId;
-export type ResultsByProperty<T> = ResultByProperty<T>[];
-export interface BinaryTreeNodeObj<T> {
-    id: BinaryTreeNodeId;
-    val: T;
-    count?: number;
-}

package/dist/data-structures/types/bst.d.ts

@@ -1,7 +0,0 @@
-import { BSTNode } from '../binary-tree';
-import type { BinaryTreeNodeId } from './binary-tree';
-export type BSTComparator = (a: BinaryTreeNodeId, b: BinaryTreeNodeId) => number;
-export type BSTDeletedResult<T> = {
-    deleted: BSTNode<T> | null;
-    needBalanced: BSTNode<T> | null;
-};

package/dist/data-structures/types/directed-graph.d.ts

@@ -1,10 +0,0 @@
-import { VertexId } from './abstract-graph';
-export interface IDirectedGraph<V, E> {
-    incomingEdgesOf(vertex: V): E[];
-    outgoingEdgesOf(vertex: V): E[];
-    inDegreeOf(vertexOrId: V | VertexId): number;
-    outDegreeOf(vertexOrId: V | VertexId): number;
-    getEdgeSrc(e: E): V | null;
-    getEdgeDest(e: E): V | null;
-}
-export type TopologicalStatus = 0 | 1 | 2;

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

@@ -1 +0,0 @@
-export type DoublyLinkedListGetBy = 'node' | 'val';

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

@@ -1,7 +0,0 @@
-export interface HeapOptions<T> {
-    priority?: (element: T) => number;
-}
-export interface HeapItem<T> {
-    priority: number;
-    element: T | null;
-}

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

@@ -1,5 +0,0 @@
-import { SinglyLinkedList } from "../linked-list";
-/** Type used for filter and find methods, returning a boolean */
-export type TTestFunction<NodeData> = (data: NodeData, index: number, list: SinglyLinkedList<NodeData>) => boolean;
-/** Type used for map and forEach methods, returning anything */
-export type TMapFunction<NodeData> = (data: any, index: number, list: SinglyLinkedList<NodeData>) => any;

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

@@ -1,5 +0,0 @@
-import { BSTNode } from "../binary-tree";
-export type TreeMultiSetDeletedResult<T> = {
-    deleted: BSTNode<T> | null;
-    needBalanced: BSTNode<T> | null;
-};

package/dist/data-structures/types/utils.d.ts

@@ -1,52 +0,0 @@
-export type AnyFunction<A extends any[] = any[], R = any> = (...args: A) => R;
-export type Primitive = number | string | boolean | symbol | undefined | null | void | AnyFunction | Date;
-export type Cast<T, TComplex> = {
-    [M in keyof TComplex]: T;
-};
-export type DeepLeavesWrap<T, TComplex> = T extends string ? Cast<string, TComplex> : T extends number ? Cast<number, TComplex> : T extends boolean ? Cast<boolean, TComplex> : T extends undefined ? Cast<undefined, TComplex> : T extends null ? Cast<null, TComplex> : T extends void ? Cast<void, TComplex> : T extends symbol ? Cast<symbol, TComplex> : T extends AnyFunction ? Cast<AnyFunction, TComplex> : T extends Date ? Cast<Date, TComplex> : {
-    [K in keyof T]: T[K] extends (infer U)[] ? DeepLeavesWrap<U, TComplex>[] : DeepLeavesWrap<T[K], TComplex>;
-};
-export type JSONSerializable = {
-    [key: string]: any;
-};
-export type JSONValue = string | number | boolean | undefined | JSONObject;
-export interface JSONObject {
-    [key: string]: JSONValue;
-}
-export type TypeName<T> = T extends string ? 'string' : T extends number ? 'number' : T extends boolean ? 'boolean' : T extends undefined ? 'undefined' : T extends AnyFunction ? 'function' : 'object';
-export type JsonKeys<T> = keyof {
-    [P in keyof T]: number;
-};
-/**
- * A function that emits a side effect and does not return anything.
- */
-export type Procedure = (...args: any[]) => void;
-export type DebounceOptions = {
-    isImmediate?: boolean;
-    maxWait?: number;
-};
-export interface DebouncedFunction<F extends Procedure> {
-    cancel: () => void;
-    (this: ThisParameterType<F>, ...args: [...Parameters<F>]): void;
-}
-export type MonthKey = 'January' | 'February' | 'March' | 'April' | 'May' | 'June' | 'July' | 'August' | 'September' | 'October' | 'November' | 'December';
-export type Month = {
-    [key in MonthKey]: string;
-};
-export type UnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends ((k: infer I) => void) ? I : never;
-export declare class TreeNode<T> {
-    id: string;
-    name?: string | undefined;
-    value?: T | undefined;
-    children?: TreeNode<T>[] | undefined;
-    constructor(id: string, name?: string, value?: T, children?: TreeNode<T>[]);
-    addChildren(children: TreeNode<T> | TreeNode<T>[]): void;
-    getHeight(): number;
-}
-export type OrderType = 'InOrder' | 'PreOrder' | 'PostOrder';
-export type DeepProxy<T> = T extends (...args: any[]) => infer R ? (...args: [...Parameters<T>]) => DeepProxy<R> : T extends object ? {
-    [K in keyof T]: DeepProxy<T[K]>;
-} : T;
-export type DeepProxyOnChange = (target: any, property: string | symbol, value: any, receiver: any, descriptor: any, result: any) => void;
-export type DeepProxyOnGet = (target: any, property: string | symbol, value: any, receiver: any, descriptor: any, result: any) => void;
-export type CurryFunc<T> = T extends (...args: infer Args) => infer R ? Args extends [infer Arg, ...infer RestArgs] ? (arg: Arg) => CurryFunc<(...args: RestArgs) => R> : R : T;

package/dist/data-structures/types/utils.js

@@ -1,54 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.TreeNode = void 0;
-var arr = ['1', 2, 4, 5, 6];
-var a = 2;
-var TreeNode = /** @class */ (function () {
-    function TreeNode(id, name, value, children) {
-        this.id = id;
-        this.name = name || '';
-        this.value = value || undefined;
-        this.children = children || [];
-    }
-    // TODO get set
-    // get name (): string | undefined {
-    //     return this.name;
-    // }
-    //
-    // set name (name: string | undefined) {
-    //     this.name = name;
-    // }
-    TreeNode.prototype.addChildren = function (children) {
-        if (!this.children) {
-            this.children = [];
-        }
-        if (children instanceof TreeNode) {
-            this.children.push(children);
-        }
-        else {
-            this.children = this.children.concat(children);
-        }
-    };
-    TreeNode.prototype.getHeight = function () {
-        // eslint-disable-next-line @typescript-eslint/no-this-alias
-        var beginRoot = this;
-        var maxDepth = 1;
-        if (beginRoot) {
-            var bfs_1 = function (node, level) {
-                if (level > maxDepth) {
-                    maxDepth = level;
-                }
-                var children = node.children;
-                if (children) {
-                    for (var i = 0, len = children.length; i < len; i++) {
-                        bfs_1(children[i], level + 1);
-                    }
-                }
-            };
-            bfs_1(beginRoot, 1);
-        }
-        return maxDepth;
-    };
-    return TreeNode;
-}());
-exports.TreeNode = TreeNode;

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

@@ -1,3 +0,0 @@
-export class AaTree {
-
-}