package.json

{
  "name": "@rioam2/bstjs",
  "version": "1.0.0",
  "description": "Basic Dictionary ADT implementation using a Binary-Search-Tree (BST) in Javascript",
  "keywords": [
    "binary search tree",
    "dictionary",
    "bst",
    "bstjs",
    "tree",
    "AVL tree",
    "search",
    "search tree"
  ],
  "main": "index.js",
  "scripts": {
    "build": "tsc",
    "testWatch": "nodemon",
    "test": "npm run-script build && mocha --reporter spec"
  },
  "repository": {
    "type": "git",
    "url": "https://github.com/rioam2/bstjs"
  },
  "author": "rioam2",
  "license": "MIT",
  "devDependencies": {
    "chai": "^4.2.0",
    "mocha": "^7.0.1",
    "typescript": "^3.2.2",
    "nodemon": "^2.0.0"
  },
  "dependencies": {
    "@types/node": "^16.4.3"
  }
}