data-structure-typed 1.34.9 → 1.35.1

package/.github/ISSUE_TEMPLATE/bug_report.md

@@ -0,0 +1,38 @@
+---
+name: Bug report
+about: Create a report to help us improve
+title: ''
+labels: ''
+assignees: ''
+
+---
+
+**Describe the bug**
+A clear and concise description of what the bug is.
+
+**To Reproduce**
+Steps to reproduce the behavior:
+1. Go to '...'
+2. Click on '....'
+3. Scroll down to '....'
+4. See error
+
+**Expected behavior**
+A clear and concise description of what you expected to happen.
+
+**Screenshots**
+If applicable, add screenshots to help explain your problem.
+
+**Desktop (please complete the following information):**
+ - OS: [e.g. iOS]
+ - Browser [e.g. chrome, safari]
+ - Version [e.g. 22]
+
+**Smartphone (please complete the following information):**
+ - Device: [e.g. iPhone6]
+ - OS: [e.g. iOS8.1]
+ - Browser [e.g. stock browser, safari]
+ - Version [e.g. 22]
+
+**Additional context**
+Add any other context about the problem here.

package/.github/ISSUE_TEMPLATE/custom.md

@@ -0,0 +1,10 @@
+---
+name: Custom issue template
+about: Describe this issue template's purpose here.
+title: ''
+labels: ''
+assignees: ''
+
+---
+
+

package/.github/ISSUE_TEMPLATE/feature_request.md

@@ -0,0 +1,20 @@
+---
+name: Feature request
+about: Suggest an idea for this project
+title: ''
+labels: ''
+assignees: ''
+
+---
+
+**Is your feature request related to a problem? Please describe.**
+A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
+
+**Describe the solution you'd like**
+A clear and concise description of what you want to happen.
+
+**Describe alternatives you've considered**
+A clear and concise description of any alternative solutions or features you've considered.
+
+**Additional context**
+Add any other context or screenshots about the feature request here.

package/.github/workflows/ci.yml

@@ -44,6 +44,9 @@ jobs:
       - name: Build and documentation
         run: npm run build
 
+      - name: Update Individuals
+        run: npm run update:individuals
+
       - name: Run tests
         run: npm test
 

package/CHANGELOG.md

@@ -8,7 +8,9 @@ All notable changes to this project will be documented in this file.
 - [Semantic Versioning](https://semver.org/spec/v2.0.0.html)
 - [`auto-changelog`](https://github.com/CookPete/auto-changelog)
 
-## [v1.34.9](https://github.com/zrwusa/data-structure-typed/compare/v1.34.1...main) (upcoming)
+## [v1.35.1](https://github.com/zrwusa/data-structure-typed/compare/v1.35.0...main) (upcoming)
+
+## [v1.35.0](https://github.com/zrwusa/data-structure-typed/compare/v1.34.1...v1.35.0) (11 October 2023)
 
 ## [v1.34.1](https://github.com/zrwusa/data-structure-typed/compare/v1.33.4...v1.34.1) (6 October 2023)
 

package/CONTRIBUTING.md

@@ -0,0 +1,18 @@
+## Contributing
+
+**General Rules**
+
+- As much as possible, try to follow the existing format of markdown and code.
+- Don't forget to run `npm run lint` and `npm test` before submitting pull requests.
+- Make sure that **100%** of your code is covered by tests.
+
+
+**Contributing New Data Structures**
+
+- Make your pull requests to be **specific** and **focused**. Instead of
+  contributing "several data structures" all at once contribute them all
+  one by one separately (i.e. one pull request for "RBTree", another one
+  for "AATree" and so on).
+- Provide **README.md** for each of the data structure **with explanations** of
+  the algorithm and **with links** to further readings.
+- Describe what you do in code using **comments**.

package/lib/interfaces/abstract-binary-tree.d.ts

@@ -1,84 +1,7 @@
-import { AbstractBinaryTreeNodeProperties, AbstractBinaryTreeNodeProperty, BinaryTreeDeletedResult, BinaryTreeNodeKey, BinaryTreeNodePropertyName, DFSOrderPattern, FamilyPosition, LoopType, NodeOrPropertyName } from '../types';
+import { BinaryTreeNodeKey } from '../types';
 import { AbstractBinaryTreeNode } from '../data-structures';
 export interface IAbstractBinaryTreeNode<T, NEIGHBOR extends IAbstractBinaryTreeNode<T, NEIGHBOR>> {
-    key: BinaryTreeNodeKey;
-    val: T | undefined;
-    get left(): NEIGHBOR | null | undefined;
-    set left(v: NEIGHBOR | null | undefined);
-    get right(): NEIGHBOR | null | undefined;
-    set right(v: NEIGHBOR | null | undefined);
-    parent: NEIGHBOR | null | undefined;
-    get familyPosition(): FamilyPosition;
 }
 export interface IAbstractBinaryTree<N extends AbstractBinaryTreeNode<N['val'], N>> {
     createNode(key: BinaryTreeNodeKey, val?: N['val'], count?: number): N | null;
-    get loopType(): LoopType;
-    get visitedKey(): BinaryTreeNodeKey[];
-    get visitedVal(): Array<N['val']>;
-    get visitedNode(): N[];
-    get root(): N | null;
-    get size(): number;
-    swapLocation(srcNode: N, destNode: N): N;
-    clear(): void;
-    isEmpty(): boolean;
-    add(key: BinaryTreeNodeKey | N, val?: N['val']): N | null | undefined;
-    addMany(keysOrNodes: (BinaryTreeNodeKey | N | null)[], data?: N['val'][]): (N | null | undefined)[];
-    refill(keysOrNodes: (BinaryTreeNodeKey | N | null)[], data?: N[] | Array<N['val']>): boolean;
-    remove(key: BinaryTreeNodeKey, ignoreCount?: boolean): BinaryTreeDeletedResult<N>[];
-    getDepth(node: N): number;
-    getHeight(beginRoot?: N | null): number;
-    getMinHeight(beginRoot?: N | null): number;
-    isPerfectlyBalanced(beginRoot?: N | null): boolean;
-    getNodes(nodeProperty: BinaryTreeNodeKey | N, propertyName?: BinaryTreeNodePropertyName, onlyOne?: boolean): N[];
-    has(nodeProperty: BinaryTreeNodeKey | N, propertyName?: BinaryTreeNodePropertyName): boolean;
-    get(nodeProperty: BinaryTreeNodeKey | N, propertyName?: BinaryTreeNodePropertyName): N | null;
-    getPathToRoot(node: N): N[];
-    getLeftMost(): N | null;
-    getLeftMost(node: N): N;
-    getLeftMost(node?: N | null): N | null;
-    getRightMost(): N | null;
-    getRightMost(node: N): N;
-    getRightMost(node?: N | null): N | null;
-    isSubtreeBST(node: N | null): boolean;
-    isBST(): boolean;
-    getSubTreeSize(subTreeRoot: N | null | undefined): number;
-    subTreeSum(subTreeRoot: N, propertyName?: BinaryTreeNodePropertyName): number;
-    subTreeAdd(subTreeRoot: N, delta: number, propertyName?: BinaryTreeNodePropertyName): boolean;
-    bfs(): BinaryTreeNodeKey[];
-    bfs(nodeOrPropertyName: 'key'): BinaryTreeNodeKey[];
-    bfs(nodeOrPropertyName: 'val'): N['val'][];
-    bfs(nodeOrPropertyName: 'node'): N[];
-    bfs(nodeOrPropertyName: 'count'): number[];
-    bfs(nodeOrPropertyName?: NodeOrPropertyName): AbstractBinaryTreeNodeProperties<N>;
-    dfs(): BinaryTreeNodeKey[];
-    dfs(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'key'): BinaryTreeNodeKey[];
-    dfs(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'val'): N[];
-    dfs(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'node'): N[];
-    dfs(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'count'): number[];
-    dfs(pattern?: 'in' | 'pre' | 'post', nodeOrPropertyName?: NodeOrPropertyName): AbstractBinaryTreeNodeProperties<N>;
-    dfsIterative(): BinaryTreeNodeKey[];
-    dfsIterative(pattern: DFSOrderPattern): BinaryTreeNodeKey[];
-    dfsIterative(pattern: DFSOrderPattern, nodeOrPropertyName: 'key'): BinaryTreeNodeKey[];
-    dfsIterative(pattern: DFSOrderPattern, nodeOrPropertyName: 'val'): N['val'][];
-    dfsIterative(pattern: DFSOrderPattern, nodeOrPropertyName: 'node'): N[];
-    dfsIterative(pattern?: DFSOrderPattern, nodeOrPropertyName?: NodeOrPropertyName): AbstractBinaryTreeNodeProperties<N>;
-    levelIterative(node: N | null): BinaryTreeNodeKey[];
-    levelIterative(node: N | null, nodeOrPropertyName?: 'key'): BinaryTreeNodeKey[];
-    levelIterative(node: N | null, nodeOrPropertyName?: 'val'): N['val'][];
-    levelIterative(node: N | null, nodeOrPropertyName?: 'node'): N[];
-    levelIterative(node: N | null, nodeOrPropertyName?: 'count'): number[];
-    levelIterative(node: N | null, nodeOrPropertyName?: NodeOrPropertyName): AbstractBinaryTreeNodeProperties<N>;
-    listLevels(node: N | null): BinaryTreeNodeKey[][];
-    listLevels(node: N | null, nodeOrPropertyName?: 'key'): BinaryTreeNodeKey[][];
-    listLevels(node: N | null, nodeOrPropertyName?: 'val'): N['val'][][];
-    listLevels(node: N | null, nodeOrPropertyName?: 'node'): N[][];
-    listLevels(node: N | null, nodeOrPropertyName?: 'count'): number[][];
-    listLevels(node: N | null, nodeOrPropertyName?: NodeOrPropertyName): AbstractBinaryTreeNodeProperty<N>[][];
-    getPredecessor(node: N): N;
-    morris(): BinaryTreeNodeKey[];
-    morris(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'key'): BinaryTreeNodeKey[];
-    morris(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'val'): N[];
-    morris(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'node'): N[];
-    morris(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'count'): number[];
-    morris(pattern?: 'in' | 'pre' | 'post', nodeOrPropertyName?: NodeOrPropertyName): AbstractBinaryTreeNodeProperties<N>;
 }

package/lib/interfaces/abstract-graph.d.ts

@@ -1,17 +1,5 @@
 import { VertexKey } from '../types';
 export interface IAbstractGraph<V, E> {
-    hasVertex(vertexOrKey: V | VertexKey): boolean;
-    addVertex(key: VertexKey, val?: V): boolean;
-    removeVertex(vertexOrKey: V | VertexKey): boolean;
-    removeAllVertices(vertices: V[] | VertexKey[]): boolean;
-    degreeOf(vertexOrKey: V | VertexKey): number;
-    edgesOf(vertexOrKey: V | VertexKey): E[];
-    hasEdge(src: V | VertexKey, dest: V | VertexKey): boolean;
-    getEdge(srcOrKey: V | VertexKey, destOrKey: V | VertexKey): E | null;
-    edgeSet(): E[];
-    addEdge(src: V | VertexKey, dest: V | VertexKey, weight: number, val: E): boolean;
-    removeEdge(edge: E): E | null;
-    setEdgeWeight(srcOrKey: V | VertexKey, destOrKey: V | VertexKey, weight: number): boolean;
-    getMinPathBetween(v1: V | VertexKey, v2: V | VertexKey, isWeight?: boolean): V[] | null;
-    getNeighbors(vertexOrKey: V | VertexKey): V[];
+    createVertex(key: VertexKey, val?: V): V;
+    createEdge(srcOrV1: VertexKey | string, destOrV2: VertexKey | string, weight?: number, val?: E): E;
 }

package/lib/interfaces/avl-tree.d.ts

@@ -1,10 +1,7 @@
 import { AVLTreeNode } from '../data-structures';
 import { IBST, IBSTNode } from './bst';
-import { BinaryTreeDeletedResult, BinaryTreeNodeKey } from '../types';
 export interface IAVLTreeNode<T, NEIGHBOR extends IAVLTreeNode<T, NEIGHBOR>> extends IBSTNode<T, NEIGHBOR> {
     height: number;
 }
 export interface IAVLTree<N extends AVLTreeNode<N['val'], N>> extends IBST<N> {
-    add(key: BinaryTreeNodeKey, val?: N['val'] | null): N | null | undefined;
-    remove(key: BinaryTreeNodeKey): BinaryTreeDeletedResult<N>[];
 }

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

@@ -1,4 +1,6 @@
 import { BinaryTreeNode } from '../data-structures';
 import { IAbstractBinaryTree, IAbstractBinaryTreeNode } from './abstract-binary-tree';
-export type IBinaryTreeNode<T, NEIGHBOR extends IBinaryTreeNode<T, NEIGHBOR>> = IAbstractBinaryTreeNode<T, NEIGHBOR>;
-export type IBinaryTree<N extends BinaryTreeNode<N['val'], N>> = IAbstractBinaryTree<N>;
+export interface IBinaryTreeNode<T, NEIGHBOR extends IBinaryTreeNode<T, NEIGHBOR>> extends IAbstractBinaryTreeNode<T, NEIGHBOR> {
+}
+export interface IBinaryTree<N extends BinaryTreeNode<N['val'], N>> extends IAbstractBinaryTree<N> {
+}

package/lib/interfaces/bst.d.ts

@@ -1,17 +1,6 @@
 import { BSTNode } from '../data-structures';
 import { IBinaryTree, IBinaryTreeNode } from './binary-tree';
-import { BinaryTreeDeletedResult, BinaryTreeNodeKey, BinaryTreeNodePropertyName } from '../types';
 export interface IBSTNode<T, NEIGHBOR extends IBSTNode<T, NEIGHBOR>> extends IBinaryTreeNode<T, NEIGHBOR> {
 }
 export interface IBST<N extends BSTNode<N['val'], N>> extends IBinaryTree<N> {
-    createNode(key: BinaryTreeNodeKey, val?: N['val'], count?: number): N;
-    add(key: BinaryTreeNodeKey, val?: N['val'] | null, count?: number): N | null | undefined;
-    get(nodeProperty: BinaryTreeNodeKey | N, propertyName?: BinaryTreeNodePropertyName): N | null;
-    lastKey(): BinaryTreeNodeKey;
-    remove(key: BinaryTreeNodeKey, ignoreCount?: boolean): BinaryTreeDeletedResult<N>[];
-    getNodes(nodeProperty: BinaryTreeNodeKey | N, propertyName?: BinaryTreeNodePropertyName, onlyOne?: boolean): N[];
-    lesserSum(key: BinaryTreeNodeKey, propertyName?: BinaryTreeNodePropertyName): number;
-    allGreaterNodesAdd(node: N, delta: number, propertyName?: BinaryTreeNodePropertyName): boolean;
-    perfectlyBalance(): boolean;
-    isAVLBalanced(): boolean;
 }

package/lib/interfaces/directed-graph.d.ts

@@ -1,12 +1,3 @@
-import { VertexKey } from '../types';
 import { IAbstractGraph } from './abstract-graph';
 export interface IDirectedGraph<V, E> extends IAbstractGraph<V, E> {
-    incomingEdgesOf(vertex: V): E[];
-    outgoingEdgesOf(vertex: V): E[];
-    inDegreeOf(vertexOrKey: V | VertexKey): number;
-    outDegreeOf(vertexOrKey: V | VertexKey): number;
-    getEdgeSrc(e: E): V | null;
-    getEdgeDest(e: E): V | null;
-    removeEdgeSrcToDest(srcOrKey: V | VertexKey, destOrKey: V | VertexKey): E | null;
-    removeEdgesBetween(v1: V | VertexKey, v2: V | VertexKey): E[];
 }

package/lib/interfaces/rb-tree.d.ts

@@ -1,7 +1,6 @@
 import { RBTreeNode } from '../data-structures';
 import { IBST, IBSTNode } from './bst';
-import { BinaryTreeNodeKey } from '../types';
-export type IRBTreeNode<T, NEIGHBOR extends IRBTreeNode<T, NEIGHBOR>> = IBSTNode<T, NEIGHBOR>;
+export interface IRBTreeNode<T, NEIGHBOR extends IRBTreeNode<T, NEIGHBOR>> extends IBSTNode<T, NEIGHBOR> {
+}
 export interface IRBTree<N extends RBTreeNode<N['val'], N>> extends IBST<N> {
-    createNode(key: BinaryTreeNodeKey, val?: N['val'], count?: number): N;
 }

package/lib/interfaces/tree-multiset.d.ts

@@ -1,5 +1,6 @@
 import { TreeMultisetNode } from '../data-structures';
-import { IBSTNode } from './bst';
-import { IAVLTree } from './avl-tree';
-export type ITreeMultisetNode<T, NEIGHBOR extends ITreeMultisetNode<T, NEIGHBOR>> = IBSTNode<T, NEIGHBOR>;
-export type ITreeMultiset<N extends TreeMultisetNode<N['val'], N>> = IAVLTree<N>;
+import { IAVLTree, IAVLTreeNode } from './avl-tree';
+export interface ITreeMultisetNode<T, NEIGHBOR extends ITreeMultisetNode<T, NEIGHBOR>> extends IAVLTreeNode<T, NEIGHBOR> {
+}
+export interface ITreeMultiset<N extends TreeMultisetNode<N['val'], N>> extends IAVLTree<N> {
+}

package/lib/interfaces/undirected-graph.d.ts

@@ -1,5 +1,3 @@
-import { VertexKey } from '../types';
 import { IAbstractGraph } from './abstract-graph';
 export interface IUNDirectedGraph<V, E> extends IAbstractGraph<V, E> {
-    removeEdgeBetween(v1: V | VertexKey, v2: V | VertexKey): E | null;
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.34.9",
+  "version": "1.35.1",
   "description": "Data Structures of Javascript & TypeScript. Binary Tree, BST, Graph, Heap, Priority Queue, Linked List, Queue, Deque, Stack, AVL Tree, Tree Multiset, Trie, Directed Graph, Undirected Graph, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue.",
   "main": "dist/index.js",
   "module": "lib/index.js",
@@ -22,13 +22,13 @@
     "fix:src": "npm run lint:src && npm run format:src",
     "fix:test": "npm run lint:test && npm run format:test",
     "fix": "npm run fix:src && npm run fix:test",
-    "update:test-deps": "npm i avl-tree-typed binary-tree-typed bst-typed heap-typed --save-dev",
+    "update:individuals": "npm i avl-tree-typed binary-tree-typed bst-typed heap-typed --save-dev",
     "install:individuals": "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 queue-typed --save-dev",
     "test": "jest",
     "check:deps": "dependency-cruiser src",
     "changelog": "auto-changelog",
     "coverage:badge": "istanbul-badges-readme",
-    "ci": "env && npm run lint && npm run build && npm run test && git fetch --tags && npm run changelog"
+    "ci": "env && npm run lint && npm run build && npm run update:individuals && npm run test && git fetch --tags && npm run changelog"
   },
   "repository": {
     "type": "git",
@@ -50,17 +50,17 @@
     "@typescript-eslint/eslint-plugin": "^6.7.4",
     "@typescript-eslint/parser": "^6.7.4",
     "auto-changelog": "^2.4.0",
-    "avl-tree-typed": "^1.34.8",
+    "avl-tree-typed": "^1.35.0",
     "benchmark": "^2.1.4",
-    "binary-tree-typed": "^1.34.8",
-    "bst-typed": "^1.34.8",
+    "binary-tree-typed": "^1.35.0",
+    "bst-typed": "^1.35.0",
     "dependency-cruiser": "^14.1.0",
     "eslint": "^8.50.0",
     "eslint-config-prettier": "^9.0.0",
     "eslint-import-resolver-alias": "^1.1.2",
     "eslint-import-resolver-typescript": "^3.6.1",
     "eslint-plugin-import": "^2.28.1",
-    "heap-typed": "^1.34.8",
+    "heap-typed": "^1.35.0",
     "istanbul-badges-readme": "^1.8.5",
     "jest": "^29.7.0",
     "prettier": "^3.0.3",

package/src/interfaces/abstract-binary-tree.ts

@@ -1,176 +1,8 @@
-import {
-  AbstractBinaryTreeNodeProperties,
-  AbstractBinaryTreeNodeProperty,
-  BinaryTreeDeletedResult,
-  BinaryTreeNodeKey,
-  BinaryTreeNodePropertyName,
-  DFSOrderPattern,
-  FamilyPosition,
-  LoopType,
-  NodeOrPropertyName
-} from '../types';
+import {BinaryTreeNodeKey} from '../types';
 import {AbstractBinaryTreeNode} from '../data-structures';
 
-export interface IAbstractBinaryTreeNode<T, NEIGHBOR extends IAbstractBinaryTreeNode<T, NEIGHBOR>> {
-  key: BinaryTreeNodeKey;
-
-  val: T | undefined;
-
-  get left(): NEIGHBOR | null | undefined;
-
-  set left(v: NEIGHBOR | null | undefined);
-
-  get right(): NEIGHBOR | null | undefined;
-
-  set right(v: NEIGHBOR | null | undefined);
-
-  parent: NEIGHBOR | null | undefined;
-
-  get familyPosition(): FamilyPosition;
-}
+export interface IAbstractBinaryTreeNode<T, NEIGHBOR extends IAbstractBinaryTreeNode<T, NEIGHBOR>> {}
 
 export interface IAbstractBinaryTree<N extends AbstractBinaryTreeNode<N['val'], N>> {
   createNode(key: BinaryTreeNodeKey, val?: N['val'], count?: number): N | null;
-
-  get loopType(): LoopType;
-
-  get visitedKey(): BinaryTreeNodeKey[];
-
-  get visitedVal(): Array<N['val']>;
-
-  get visitedNode(): N[];
-
-  get root(): N | null;
-
-  get size(): number;
-
-  swapLocation(srcNode: N, destNode: N): N;
-
-  clear(): void;
-
-  isEmpty(): boolean;
-
-  add(key: BinaryTreeNodeKey | N, val?: N['val']): N | null | undefined;
-
-  addMany(keysOrNodes: (BinaryTreeNodeKey | N | null)[], data?: N['val'][]): (N | null | undefined)[];
-
-  refill(keysOrNodes: (BinaryTreeNodeKey | N | null)[], data?: N[] | Array<N['val']>): boolean;
-
-  remove(key: BinaryTreeNodeKey, ignoreCount?: boolean): BinaryTreeDeletedResult<N>[];
-
-  getDepth(node: N): number;
-
-  getHeight(beginRoot?: N | null): number;
-
-  getMinHeight(beginRoot?: N | null): number;
-
-  isPerfectlyBalanced(beginRoot?: N | null): boolean;
-
-  getNodes(nodeProperty: BinaryTreeNodeKey | N, propertyName?: BinaryTreeNodePropertyName, onlyOne?: boolean): N[];
-
-  has(nodeProperty: BinaryTreeNodeKey | N, propertyName?: BinaryTreeNodePropertyName): boolean;
-
-  get(nodeProperty: BinaryTreeNodeKey | N, propertyName?: BinaryTreeNodePropertyName): N | null;
-
-  getPathToRoot(node: N): N[];
-
-  getLeftMost(): N | null;
-
-  getLeftMost(node: N): N;
-
-  getLeftMost(node?: N | null): N | null;
-
-  getRightMost(): N | null;
-
-  getRightMost(node: N): N;
-
-  getRightMost(node?: N | null): N | null;
-
-  isSubtreeBST(node: N | null): boolean;
-
-  isBST(): boolean;
-
-  getSubTreeSize(subTreeRoot: N | null | undefined): number;
-
-  // --- start additional methods ---
-
-  subTreeSum(subTreeRoot: N, propertyName?: BinaryTreeNodePropertyName): number;
-
-  subTreeAdd(subTreeRoot: N, delta: number, propertyName?: BinaryTreeNodePropertyName): boolean;
-
-  bfs(): BinaryTreeNodeKey[];
-
-  bfs(nodeOrPropertyName: 'key'): BinaryTreeNodeKey[];
-
-  bfs(nodeOrPropertyName: 'val'): N['val'][];
-
-  bfs(nodeOrPropertyName: 'node'): N[];
-
-  bfs(nodeOrPropertyName: 'count'): number[];
-
-  bfs(nodeOrPropertyName?: NodeOrPropertyName): AbstractBinaryTreeNodeProperties<N>;
-
-  dfs(): BinaryTreeNodeKey[];
-
-  dfs(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'key'): BinaryTreeNodeKey[];
-
-  dfs(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'val'): N[];
-
-  dfs(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'node'): N[];
-
-  dfs(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'count'): number[];
-
-  dfs(pattern?: 'in' | 'pre' | 'post', nodeOrPropertyName?: NodeOrPropertyName): AbstractBinaryTreeNodeProperties<N>;
-
-  dfsIterative(): BinaryTreeNodeKey[];
-
-  dfsIterative(pattern: DFSOrderPattern): BinaryTreeNodeKey[];
-
-  dfsIterative(pattern: DFSOrderPattern, nodeOrPropertyName: 'key'): BinaryTreeNodeKey[];
-
-  dfsIterative(pattern: DFSOrderPattern, nodeOrPropertyName: 'val'): N['val'][];
-
-  dfsIterative(pattern: DFSOrderPattern, nodeOrPropertyName: 'node'): N[];
-
-  dfsIterative(pattern?: DFSOrderPattern, nodeOrPropertyName?: NodeOrPropertyName): AbstractBinaryTreeNodeProperties<N>;
-
-  levelIterative(node: N | null): BinaryTreeNodeKey[];
-
-  levelIterative(node: N | null, nodeOrPropertyName?: 'key'): BinaryTreeNodeKey[];
-
-  levelIterative(node: N | null, nodeOrPropertyName?: 'val'): N['val'][];
-
-  levelIterative(node: N | null, nodeOrPropertyName?: 'node'): N[];
-
-  levelIterative(node: N | null, nodeOrPropertyName?: 'count'): number[];
-
-  levelIterative(node: N | null, nodeOrPropertyName?: NodeOrPropertyName): AbstractBinaryTreeNodeProperties<N>;
-
-  listLevels(node: N | null): BinaryTreeNodeKey[][];
-
-  listLevels(node: N | null, nodeOrPropertyName?: 'key'): BinaryTreeNodeKey[][];
-
-  listLevels(node: N | null, nodeOrPropertyName?: 'val'): N['val'][][];
-
-  listLevels(node: N | null, nodeOrPropertyName?: 'node'): N[][];
-
-  listLevels(node: N | null, nodeOrPropertyName?: 'count'): number[][];
-
-  listLevels(node: N | null, nodeOrPropertyName?: NodeOrPropertyName): AbstractBinaryTreeNodeProperty<N>[][];
-
-  getPredecessor(node: N): N;
-
-  morris(): BinaryTreeNodeKey[];
-
-  morris(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'key'): BinaryTreeNodeKey[];
-
-  morris(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'val'): N[];
-
-  morris(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'node'): N[];
-
-  morris(pattern?: DFSOrderPattern, nodeOrPropertyName?: 'count'): number[];
-
-  morris(pattern?: 'in' | 'pre' | 'post', nodeOrPropertyName?: NodeOrPropertyName): AbstractBinaryTreeNodeProperties<N>;
-
-  // --- end additional methods ---
 }

package/src/interfaces/abstract-graph.ts

@@ -1,31 +1,7 @@
 import {VertexKey} from '../types';
 
 export interface IAbstractGraph<V, E> {
-  hasVertex(vertexOrKey: V | VertexKey): boolean;
+  createVertex(key: VertexKey, val?: V): V;
 
-  addVertex(key: VertexKey, val?: V): boolean;
-
-  removeVertex(vertexOrKey: V | VertexKey): boolean;
-
-  removeAllVertices(vertices: V[] | VertexKey[]): boolean;
-
-  degreeOf(vertexOrKey: V | VertexKey): number;
-
-  edgesOf(vertexOrKey: V | VertexKey): E[];
-
-  hasEdge(src: V | VertexKey, dest: V | VertexKey): boolean;
-
-  getEdge(srcOrKey: V | VertexKey, destOrKey: V | VertexKey): E | null;
-
-  edgeSet(): E[];
-
-  addEdge(src: V | VertexKey, dest: V | VertexKey, weight: number, val: E): boolean;
-
-  removeEdge(edge: E): E | null;
-
-  setEdgeWeight(srcOrKey: V | VertexKey, destOrKey: V | VertexKey, weight: number): boolean;
-
-  getMinPathBetween(v1: V | VertexKey, v2: V | VertexKey, isWeight?: boolean): V[] | null;
-
-  getNeighbors(vertexOrKey: V | VertexKey): V[];
+  createEdge(srcOrV1: VertexKey | string, destOrV2: VertexKey | string, weight?: number, val?: E): E;
 }

package/src/interfaces/avl-tree.ts

@@ -1,27 +1,8 @@
 import {AVLTreeNode} from '../data-structures';
 import {IBST, IBSTNode} from './bst';
-import {BinaryTreeDeletedResult, BinaryTreeNodeKey} from '../types';
 
 export interface IAVLTreeNode<T, NEIGHBOR extends IAVLTreeNode<T, NEIGHBOR>> extends IBSTNode<T, NEIGHBOR> {
   height: number;
 }
 
-export interface IAVLTree<N extends AVLTreeNode<N['val'], N>> extends IBST<N> {
-  add(key: BinaryTreeNodeKey, val?: N['val'] | null): N | null | undefined;
-
-  remove(key: BinaryTreeNodeKey): BinaryTreeDeletedResult<N>[];
-
-  // _balanceFactor(node: N): number
-  //
-  // _updateHeight(node: N): void
-  //
-  // _balancePath(node: N): void
-  //
-  // _balanceLL(A: N): void
-  //
-  // _balanceLR(A: N): void
-  //
-  // _balanceRR(A: N): void
-  //
-  // _balanceRL(A: N): void
-}
+export interface IAVLTree<N extends AVLTreeNode<N['val'], N>> extends IBST<N> {}

package/src/interfaces/binary-tree.ts

@@ -1,6 +1,7 @@
 import {BinaryTreeNode} from '../data-structures';
 import {IAbstractBinaryTree, IAbstractBinaryTreeNode} from './abstract-binary-tree';
 
-export type IBinaryTreeNode<T, NEIGHBOR extends IBinaryTreeNode<T, NEIGHBOR>> = IAbstractBinaryTreeNode<T, NEIGHBOR>;
+export interface IBinaryTreeNode<T, NEIGHBOR extends IBinaryTreeNode<T, NEIGHBOR>>
+  extends IAbstractBinaryTreeNode<T, NEIGHBOR> {}
 
-export type IBinaryTree<N extends BinaryTreeNode<N['val'], N>> = IAbstractBinaryTree<N>;
+export interface IBinaryTree<N extends BinaryTreeNode<N['val'], N>> extends IAbstractBinaryTree<N> {}

package/src/interfaces/bst.ts

@@ -1,31 +1,6 @@
 import {BSTNode} from '../data-structures';
 import {IBinaryTree, IBinaryTreeNode} from './binary-tree';
-import {BinaryTreeDeletedResult, BinaryTreeNodeKey, BinaryTreeNodePropertyName} from '../types';
 
 export interface IBSTNode<T, NEIGHBOR extends IBSTNode<T, NEIGHBOR>> extends IBinaryTreeNode<T, NEIGHBOR> {}
 
-export interface IBST<N extends BSTNode<N['val'], N>> extends IBinaryTree<N> {
-  createNode(key: BinaryTreeNodeKey, val?: N['val'], count?: number): N;
-
-  add(key: BinaryTreeNodeKey, val?: N['val'] | null, count?: number): N | null | undefined;
-
-  get(nodeProperty: BinaryTreeNodeKey | N, propertyName?: BinaryTreeNodePropertyName): N | null;
-
-  lastKey(): BinaryTreeNodeKey;
-
-  remove(key: BinaryTreeNodeKey, ignoreCount?: boolean): BinaryTreeDeletedResult<N>[];
-
-  getNodes(nodeProperty: BinaryTreeNodeKey | N, propertyName?: BinaryTreeNodePropertyName, onlyOne?: boolean): N[];
-
-  // --- start additional functions
-
-  lesserSum(key: BinaryTreeNodeKey, propertyName?: BinaryTreeNodePropertyName): number;
-
-  allGreaterNodesAdd(node: N, delta: number, propertyName?: BinaryTreeNodePropertyName): boolean;
-
-  perfectlyBalance(): boolean;
-
-  isAVLBalanced(): boolean;
-
-  // --- end additional functions
-}
+export interface IBST<N extends BSTNode<N['val'], N>> extends IBinaryTree<N> {}

package/src/interfaces/directed-graph.ts

@@ -1,20 +1,3 @@
-import {VertexKey} from '../types';
 import {IAbstractGraph} from './abstract-graph';
 
-export interface IDirectedGraph<V, E> extends IAbstractGraph<V, E> {
-  incomingEdgesOf(vertex: V): E[];
-
-  outgoingEdgesOf(vertex: V): E[];
-
-  inDegreeOf(vertexOrKey: V | VertexKey): number;
-
-  outDegreeOf(vertexOrKey: V | VertexKey): number;
-
-  getEdgeSrc(e: E): V | null;
-
-  getEdgeDest(e: E): V | null;
-
-  removeEdgeSrcToDest(srcOrKey: V | VertexKey, destOrKey: V | VertexKey): E | null;
-
-  removeEdgesBetween(v1: V | VertexKey, v2: V | VertexKey): E[];
-}
+export interface IDirectedGraph<V, E> extends IAbstractGraph<V, E> {}

package/src/interfaces/rb-tree.ts

@@ -1,9 +1,6 @@
 import {RBTreeNode} from '../data-structures';
 import {IBST, IBSTNode} from './bst';
-import {BinaryTreeNodeKey} from '../types';
 
-export type IRBTreeNode<T, NEIGHBOR extends IRBTreeNode<T, NEIGHBOR>> = IBSTNode<T, NEIGHBOR>;
+export interface IRBTreeNode<T, NEIGHBOR extends IRBTreeNode<T, NEIGHBOR>> extends IBSTNode<T, NEIGHBOR> {}
 
-export interface IRBTree<N extends RBTreeNode<N['val'], N>> extends IBST<N> {
-  createNode(key: BinaryTreeNodeKey, val?: N['val'], count?: number): N;
-}
+export interface IRBTree<N extends RBTreeNode<N['val'], N>> extends IBST<N> {}

package/src/interfaces/tree-multiset.ts

@@ -1,7 +1,7 @@
 import {TreeMultisetNode} from '../data-structures';
-import {IBSTNode} from './bst';
-import {IAVLTree} from './avl-tree';
+import {IAVLTree, IAVLTreeNode} from './avl-tree';
 
-export type ITreeMultisetNode<T, NEIGHBOR extends ITreeMultisetNode<T, NEIGHBOR>> = IBSTNode<T, NEIGHBOR>;
+export interface ITreeMultisetNode<T, NEIGHBOR extends ITreeMultisetNode<T, NEIGHBOR>>
+  extends IAVLTreeNode<T, NEIGHBOR> {}
 
-export type ITreeMultiset<N extends TreeMultisetNode<N['val'], N>> = IAVLTree<N>;
+export interface ITreeMultiset<N extends TreeMultisetNode<N['val'], N>> extends IAVLTree<N> {}

package/src/interfaces/undirected-graph.ts

@@ -1,6 +1,3 @@
-import {VertexKey} from '../types';
 import {IAbstractGraph} from './abstract-graph';
 
-export interface IUNDirectedGraph<V, E> extends IAbstractGraph<V, E> {
-  removeEdgeBetween(v1: V | VertexKey, v2: V | VertexKey): E | null;
-}
+export interface IUNDirectedGraph<V, E> extends IAbstractGraph<V, E> {}

package/test/integration/avl-tree.test.ts

@@ -31,12 +31,12 @@ describe('AVL Tree Test', () => {
     // node15 has type problem. After the uniform design, the generics of containers (DirectedGraph, BST) are based on the type of value. However, this design has a drawback: when I attempt to inherit from the Vertex or BSTNode classes, the types of the results obtained by all methods are those of the parent class.
     expect(node15?.val).toBe(15);
 
-    const dfs = tree.DFS('in', 'node');
+    const dfs = tree.dfs('in', 'node');
     expect(dfs[0].key).toBe(1);
     expect(dfs[dfs.length - 1].key).toBe(16);
 
     tree.perfectlyBalance();
-    const bfs = tree.BFS('node');
+    const bfs = tree.bfs('node');
     expect(tree.isPerfectlyBalanced()).toBe(true);
     expect(bfs[0].key).toBe(8);
     expect(bfs[bfs.length - 1].key).toBe(16);
@@ -95,12 +95,12 @@ describe('AVL Tree Test', () => {
     expect(tree.getHeight()).toBe(1);
 
     expect(tree.isAVLBalanced()).toBe(true);
-    const lastBFSIds = tree.BFS();
+    const lastBFSIds = tree.bfs();
     expect(lastBFSIds[0]).toBe(12);
     expect(lastBFSIds[1]).toBe(2);
     expect(lastBFSIds[2]).toBe(16);
 
-    const lastBFSNodes = tree.BFS('node');
+    const lastBFSNodes = tree.bfs('node');
     expect(lastBFSNodes[0].key).toBe(12);
     expect(lastBFSNodes[1].key).toBe(2);
     expect(lastBFSNodes[2].key).toBe(16);

package/test/integration/bst.test.ts

@@ -44,14 +44,14 @@ describe('Individual package BST operations test', () => {
     const node11 = bst.get(11);
     expect(node11).toBeInstanceOf(BSTNode);
 
-    const dfsInorderNodes = bst.DFS('in', 'node');
+    const dfsInorderNodes = bst.dfs('in', 'node');
     expect(dfsInorderNodes[0].key).toBe(1);
     expect(dfsInorderNodes[dfsInorderNodes.length - 1].key).toBe(16);
 
     bst.perfectlyBalance();
     expect(bst.isPerfectlyBalanced()).toBe(true);
 
-    const bfsNodesAfterBalanced = bst.BFS('node');
+    const bfsNodesAfterBalanced = bst.bfs('node');
     expect(bfsNodesAfterBalanced[0].key).toBe(8);
     expect(bfsNodesAfterBalanced[bfsNodesAfterBalanced.length - 1].key).toBe(16);
 
@@ -169,12 +169,12 @@ describe('Individual package BST operations test', () => {
 
     expect(bst.isAVLBalanced()).toBe(false);
 
-    const bfsIDs = bst.BFS();
+    const bfsIDs = bst.bfs();
     expect(bfsIDs[0]).toBe(2);
     expect(bfsIDs[1]).toBe(12);
     expect(bfsIDs[2]).toBe(16);
 
-    const bfsNodes = bst.BFS('node');
+    const bfsNodes = bst.bfs('node');
     expect(bfsNodes[0].key).toBe(2);
     expect(bfsNodes[1].key).toBe(12);
     expect(bfsNodes[2].key).toBe(16);
@@ -242,14 +242,14 @@ describe('Individual package BST operations test', () => {
     const node11 = objBST.get(11);
     expect(node11).toBeInstanceOf(BSTNode);
 
-    const dfsInorderNodes = objBST.DFS('in', 'node');
+    const dfsInorderNodes = objBST.dfs('in', 'node');
     expect(dfsInorderNodes[0].key).toBe(1);
     expect(dfsInorderNodes[dfsInorderNodes.length - 1].key).toBe(16);
 
     objBST.perfectlyBalance();
     expect(objBST.isPerfectlyBalanced()).toBe(true);
 
-    const bfsNodesAfterBalanced = objBST.BFS('node');
+    const bfsNodesAfterBalanced = objBST.bfs('node');
     expect(bfsNodesAfterBalanced[0].key).toBe(8);
     expect(bfsNodesAfterBalanced[bfsNodesAfterBalanced.length - 1].key).toBe(16);
 
@@ -367,12 +367,12 @@ describe('Individual package BST operations test', () => {
 
     expect(objBST.isAVLBalanced()).toBe(false);
 
-    const bfsIDs = objBST.BFS();
+    const bfsIDs = objBST.bfs();
     expect(bfsIDs[0]).toBe(2);
     expect(bfsIDs[1]).toBe(12);
     expect(bfsIDs[2]).toBe(16);
 
-    const bfsNodes = objBST.BFS('node');
+    const bfsNodes = objBST.bfs('node');
     expect(bfsNodes[0].key).toBe(2);
     expect(bfsNodes[1].key).toBe(12);
     expect(bfsNodes[2].key).toBe(16);

package/test/unit/data-structures/graph/directed-graph.test.ts

@@ -1,4 +1,4 @@
-import {DirectedEdge, DirectedGraph, DirectedVertex, VertexId} from '../../../../src';
+import {DirectedEdge, DirectedGraph, DirectedVertex, VertexKey} from '../../../../src';
 
 describe('DirectedGraph Operation Test', () => {
   let graph: DirectedGraph;
@@ -63,7 +63,7 @@ describe('DirectedGraph Operation Test', () => {
 });
 
 class MyVertex<V extends string> extends DirectedVertex<V> {
-  constructor(key: VertexId, val?: V) {
+  constructor(key: VertexKey, val?: V) {
     super(key, val);
     this._data = val;
   }
@@ -80,7 +80,7 @@ class MyVertex<V extends string> extends DirectedVertex<V> {
 }
 
 class MyEdge<E extends string> extends DirectedEdge<E> {
-  constructor(v1: VertexId, v2: VertexId, weight?: number, val?: E) {
+  constructor(v1: VertexKey, v2: VertexKey, weight?: number, val?: E) {
     super(v1, v2, weight, val);
     this._data = val;
   }
@@ -97,11 +97,11 @@ class MyEdge<E extends string> extends DirectedEdge<E> {
 }
 
 class MyDirectedGraph<V extends MyVertex<string>, E extends MyEdge<string>> extends DirectedGraph<V, E> {
-  createVertex(key: VertexId, val: V['val']): V {
+  createVertex(key: VertexKey, val: V['val']): V {
     return new MyVertex(key, val) as V;
   }
 
-  createEdge(src: VertexId, dest: VertexId, weight?: number, val?: E['val']): E {
+  createEdge(src: VertexKey, dest: VertexKey, weight?: number, val?: E['val']): E {
     return new MyEdge(src, dest, weight ?? 1, val) as E;
   }
 }

package/test/unit/data-structures/graph/overall.test.ts

@@ -29,8 +29,8 @@ describe('Overall Graph Operation Test', () => {
     graph.addEdge('A', 'B');
     graph.addEdge('B', 'C');
 
-    const topologicalOrderIds = graph.topologicalSort();
-    expect(topologicalOrderIds).toEqual(['A', 'B', 'C']);
+    const topologicalOrderKeys = graph.topologicalSort();
+    expect(topologicalOrderKeys).toEqual(['A', 'B', 'C']);
   });
   it('Overall UndirectedGraph Operation Test', () => {
     const graph = new UndirectedGraph();

package/test/unit/data-structures/linked-list/doubly-linked-list.test.ts

@@ -349,7 +349,7 @@ describe('DoublyLinkedList Performance Test', () => {
     for (let i = 0; i < magnitude.LINEAR; i++) {
       list.unshift(i);
     }
-    expect(performance.now() - startPushTime).toBeLessThan(bigO.LINEAR * 10);
+    expect(performance.now() - startPushTime).toBeLessThan(bigO.LINEAR * 20);
 
     expect(list.length).toBeGreaterThan(0);
     const startPopTime = performance.now();

package/test/unit/data-structures/linked-list/singly-linked-list.test.ts

@@ -384,7 +384,7 @@ describe('SinglyLinkedList Performance Test', () => {
     for (let i = 0; i < magnitude.LINEAR; i++) {
       list.push(i);
     }
-    expect(performance.now() - startPushTime).toBeLessThan(bigO.LINEAR * 10);
+    expect(performance.now() - startPushTime).toBeLessThan(bigO.LINEAR * 20);
 
     const startPopTime = performance.now();
 

package/test/unit/data-structures/graph/index.ts

@@ -1,2 +0,0 @@
-export * from './directed-graph.test';
-export * from './undirected-graph.test';

package/test/unit/data-structures/linked-list/index.ts

@@ -1,4 +0,0 @@
-export * from './singly-linked-list.test';
-export * from './doubly-linked-list.test';
-export * from './linked-list.test';
-export * from './skip-linked-list.test';