inorder-tree-layout/package.json

Index calculations for inorder layout of balanced binary trees

{
  "name": "inorder-tree-layout",
  "version": "1.0.0",
  "description": "Index calculations for inorder layout of balanced binary trees",
  "main": "inorder.js",
  "directories": {
    "test": "test"
  },
  "dependencies": {
    "bit-twiddle": "~0.0.1"
  },
  "devDependencies": {
    "tap": "~0.4.1",
    "tree-layout-tester": "~0.0.2"
  },
  "scripts": {
    "test": "tap test/*.js"
  },
  "repository": {
    "type": "git",
    "url": "git://github.com/mikolalysenko/inorder-tree-layout.git"
  },
  "keywords": [
    "binary",
    "tree",
    "search",
    "balanced",
    "inorder",
    "array",
    "layout",
    "linkless",
    "successor",
    "parent",
    "left",
    "right",
    "child",
    "iteration",
    "index",
    "traversal"
  ],
  "author": "Mikola Lysenko",
  "license": "MIT",
  "readmeFilename": "README.md",
  "gitHead": "5e7ce3fd50ef667d8df490ebda63b8c42c166db8"
}