package.json

{
  "name": "leettree",
  "version": "0.3.0",
  "description": "Convert array to binary tree and vice versa using level order traversal like LeetCode.",
  "main": "src/index.js",
  "scripts": {
    "test": "jest",
    "test:watch": "jest --watchAll",
    "test:coverage": "jest --coverage"
  },
  "repository": {
    "type": "git",
    "url": "git+https://github.com/ecgan/leettree.git"
  },
  "keywords": [
    "algorithm",
    "array",
    "binary tree",
    "leetcode",
    "level order traversal",
    "tree"
  ],
  "author": "Gan Eng Chin",
  "license": "MIT",
  "bugs": {
    "url": "https://github.com/ecgan/leettree/issues"
  },
  "homepage": "https://github.com/ecgan/leettree#readme",
  "devDependencies": {
    "codecov": "^3.5.0",
    "eslint": "^6.1.0",
    "eslint-config-standard": "^13.0.1",
    "eslint-plugin-import": "^2.18.2",
    "eslint-plugin-jest": "^22.15.1",
    "eslint-plugin-node": "^9.1.0",
    "eslint-plugin-promise": "^4.2.1",
    "eslint-plugin-standard": "^4.0.0",
    "jest": "^24.8.0"
  }
}