{"id":31846914,"url":"https://github.com/vasturiano/d3-binarytree","last_synced_at":"2025-10-12T09:17:46.510Z","repository":{"id":18724020,"uuid":"85158931","full_name":"vasturiano/d3-binarytree","owner":"vasturiano","description":"One-dimensional recursive spatial subdivision.","archived":false,"fork":false,"pushed_at":"2023-07-18T21:17:26.000Z","size":251,"stargazers_count":9,"open_issues_count":1,"forks_count":3,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-09-22T03:38:40.433Z","etag":null,"topics":["binary-trees","d3-binarytree","d3js","k-trees"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/vasturiano.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-03-16T06:07:35.000Z","updated_at":"2024-02-11T07:26:41.000Z","dependencies_parsed_at":"2024-06-18T19:48:06.734Z","dependency_job_id":"de44e637-1962-4f42-8adc-d9233a05000c","html_url":"https://github.com/vasturiano/d3-binarytree","commit_stats":{"total_commits":204,"total_committers":3,"mean_commits":68.0,"dds":"0.23529411764705888","last_synced_commit":"5c5e5a36910ddae8fa4ba535e030eb020ffd4857"},"previous_names":[],"tags_count":15,"template":false,"template_full_name":null,"purl":"pkg:github/vasturiano/d3-binarytree","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vasturiano%2Fd3-binarytree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vasturiano%2Fd3-binarytree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vasturiano%2Fd3-binarytree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vasturiano%2Fd3-binarytree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/vasturiano","download_url":"https://codeload.github.com/vasturiano/d3-binarytree/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vasturiano%2Fd3-binarytree/sbom","scorecard":{"id":916807,"data":{"date":"2025-08-11","repo":{"name":"github.com/vasturiano/d3-binarytree","commit":"5c5e5a36910ddae8fa4ba535e030eb020ffd4857"},"scorecard":{"version":"v5.2.1-40-gf6ed084d","commit":"f6ed084d17c9236477efd66e5b258b9d4cc7b389"},"score":2.1,"checks":[{"name":"Packaging","score":-1,"reason":"packaging workflow not detected","details":["Warn: no GitHub/GitLab publishing workflow detected."],"documentation":{"short":"Determines if the project is published as a package that others can easily download, install, easily update, and uninstall.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#packaging"}},{"name":"Maintained","score":0,"reason":"0 commit(s) and 0 issue activity found in the last 90 days -- score normalized to 0","details":null,"documentation":{"short":"Determines if the project is \"actively maintained\".","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#maintained"}},{"name":"Dangerous-Workflow","score":-1,"reason":"no workflows found","details":null,"documentation":{"short":"Determines if the project's GitHub Action workflows avoid dangerous patterns.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#dangerous-workflow"}},{"name":"Code-Review","score":0,"reason":"Found 0/30 approved changesets -- score normalized to 0","details":null,"documentation":{"short":"Determines if the project requires human code review before pull requests (aka merge requests) are merged.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#code-review"}},{"name":"Token-Permissions","score":-1,"reason":"No tokens found","details":null,"documentation":{"short":"Determines if the project's workflows follow the principle of least privilege.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#token-permissions"}},{"name":"SAST","score":0,"reason":"no SAST tool detected","details":["Warn: no pull requests merged into dev branch"],"documentation":{"short":"Determines if the project uses static code analysis.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#sast"}},{"name":"Binary-Artifacts","score":10,"reason":"no binaries found in the repo","details":null,"documentation":{"short":"Determines if the project has generated executable (binary) artifacts in the source repository.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#binary-artifacts"}},{"name":"Pinned-Dependencies","score":-1,"reason":"no dependencies found","details":null,"documentation":{"short":"Determines if the project has declared and pinned the dependencies of its build process.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#pinned-dependencies"}},{"name":"CII-Best-Practices","score":0,"reason":"no effort to earn an OpenSSF best practices badge detected","details":null,"documentation":{"short":"Determines if the project has an OpenSSF (formerly CII) Best Practices Badge.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#cii-best-practices"}},{"name":"Security-Policy","score":0,"reason":"security policy file not detected","details":["Warn: no security policy file detected","Warn: no security file to analyze","Warn: no security file to analyze","Warn: no security file to analyze"],"documentation":{"short":"Determines if the project has published a security policy.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#security-policy"}},{"name":"Fuzzing","score":0,"reason":"project is not fuzzed","details":["Warn: no fuzzer integrations found"],"documentation":{"short":"Determines if the project uses fuzzing.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#fuzzing"}},{"name":"License","score":10,"reason":"license file detected","details":["Info: project has a license file: LICENSE:0","Info: FSF or OSI recognized license: MIT License: LICENSE:0"],"documentation":{"short":"Determines if the project has defined a license.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#license"}},{"name":"Signed-Releases","score":-1,"reason":"no releases found","details":null,"documentation":{"short":"Determines if the project cryptographically signs release artifacts.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#signed-releases"}},{"name":"Branch-Protection","score":0,"reason":"branch protection not enabled on development/release branches","details":["Warn: branch protection not enabled for branch 'master'"],"documentation":{"short":"Determines if the default and release branches are protected with GitHub's branch protection settings.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#branch-protection"}},{"name":"Vulnerabilities","score":3,"reason":"7 existing vulnerabilities detected","details":["Warn: Project is vulnerable to: GHSA-v6h2-p8h4-qcjw","Warn: Project is vulnerable to: GHSA-grv7-fg5c-xmjg","Warn: Project is vulnerable to: GHSA-3xgq-45jj-v275","Warn: Project is vulnerable to: GHSA-mwcw-c2x4-8c55","Warn: Project is vulnerable to: GHSA-gcx4-mw62-g8wm","Warn: Project is vulnerable to: GHSA-76p7-773f-r4q5","Warn: Project is vulnerable to: GHSA-j8xg-fqg3-53r7"],"documentation":{"short":"Determines if the project has open, known unfixed vulnerabilities.","url":"https://github.com/ossf/scorecard/blob/f6ed084d17c9236477efd66e5b258b9d4cc7b389/docs/checks.md#vulnerabilities"}}]},"last_synced_at":"2025-08-24T21:19:48.346Z","repository_id":18724020,"created_at":"2025-08-24T21:19:48.346Z","updated_at":"2025-08-24T21:19:48.346Z"},"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279010956,"owners_count":26084837,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-12T02:00:06.719Z","response_time":53,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["binary-trees","d3-binarytree","d3js","k-trees"],"created_at":"2025-10-12T09:17:43.573Z","updated_at":"2025-10-12T09:17:46.505Z","avatar_url":"https://github.com/vasturiano.png","language":"JavaScript","readme":"d3-binarytree\n==============\n\n[![NPM package][npm-img]][npm-url]\n[![Build Size][build-size-img]][build-size-url]\n[![NPM Downloads][npm-downloads-img]][npm-downloads-url]\n\nPorted version of D3's [Quadtree](https://github.com/d3/d3-quadtree), to use with one-dimensional data structures, by removing the y coordinate.\n\nA [binary tree](https://en.wikipedia.org/wiki/Binary_tree) recursively partitions arrays into segments, dividing each array into two equally-sized halves. Each distinct point exists in a unique leaf [node](#nodes); coincident points are represented by a linked list. Binary trees can accelerate various spatial operations, such as the [Barnes–Hut approximation](https://en.wikipedia.org/wiki/Barnes–Hut_simulation) for computing many-body forces, collision detection, and searching for nearby points.\n\nSee also [d3-quadtree](https://github.com/d3/d3-quadtree) and [d3-octree](https://github.com/vasturiano/d3-octree).\n\n## Installing\n\nIf you use npm, `npm install d3-binarytree`. You can also load directly from the global [npmJS](https://npmjs.com) registry, as a bundled [standalone library](https://unpkg.com/d3-binarytree). In vanilla, a `d3` global is exported:\n\n```html\n\u003cscript src=\"https://unpkg.com/d3-binarytree\"\u003e\u003c/script\u003e\n\u003cscript\u003e\n\nconst binarytree = d3.binarytree();\n\n\u003c/script\u003e\n```\n\n## API Reference\n\n\u003ca name=\"binarytree\" href=\"#binarytree\"\u003e#\u003c/a\u003e d3.\u003cb\u003ebinarytree\u003c/b\u003e([\u003ci\u003edata\u003c/i\u003e[, \u003ci\u003ex\u003c/i\u003e]])\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/binarytree.js#L13 \"Source\")\n\nCreates a new, empty binarytree with an empty [extent](#binarytree_extent) and the default [*x*-](#binarytree_x)accessor. If *data* is specified, [adds](#binarytree_addAll) the specified array of data to the binarytree. This is equivalent to:\n\n```js\nconst tree = d3.binarytree()\n    .addAll(data);\n```\n\nIf *x* is also specified, sets the [*x*-](#binarytree_x) accessor to the specified functions before adding the specified array of data to the binarytree, equivalent to:\n\n```js\nconst tree = d3.binarytree()\n    .x(x)\n    .addAll(data);\n```\n\n\u003ca name=\"binarytree_x\" href=\"#binarytree_x\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003ex\u003c/b\u003e([\u003ci\u003ex\u003c/i\u003e]) [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/x.js \"Source\")\n\nIf *x* is specified, sets the current *x*-coordinate accessor and returns the binarytree. If *x* is not specified, returns the current *x*-accessor, which defaults to:\n\n```js\nfunction x(d) {\n  return d[0];\n}\n```\n\nThe *x*-acccessor is used to derive the *x*-coordinate of data when [adding](#binarytree_add) to and [removing](#binarytree_remove) from the tree. It is also used when [finding](#binarytree_find) to re-access the coordinates of data previously added to the tree; therefore, the *x*-accessor must be consistent, returning the same value given the same input.\n\n\u003ca name=\"binarytree_extent\" href=\"#binarytree_extent\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003eextent\u003c/b\u003e([*extent*])\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/extent.js \"Source\")\n\nIf *extent* is specified, expands the binarytree to [cover](#binarytree_cover) the specified points [[*x0*], [*x1*]] and returns the binarytree. If *extent* is not specified, returns the binarytree’s current extent [[*x0*], [*x1*]], where *x0* is the inclusive lower bound and *x1* is the inclusive upper bound, or undefined if the binarytree has no extent. The extent may also be expanded by calling [*binarytree*.cover](#binarytree_cover) or [*binarytree*.add](#binarytree_add).\n\n\u003ca name=\"binarytree_cover\" href=\"#binarytree_cover\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003ecover\u003c/b\u003e(\u003ci\u003ex\u003c/i\u003e)\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/cover.js \"Source\")\n\nExpands the binarytree to cover the specified point ⟨*x*⟩, and returns the binarytree. If the binarytree’s extent already covers the specified point, this method does nothing. If the binarytree has an extent, the extent is repeatedly doubled to cover the specified point, wrapping the [root](#binarytree_root) [node](#nodes) as necessary; if the binarytree is empty, the extent is initialized to the extent [[⌊*x*⌋], [⌈*x*⌉]]. (Rounding is necessary such that if the extent is later doubled, the boundaries of existing segments do not change due to floating point error.)\n\n\u003ca name=\"binarytree_add\" href=\"#binarytree_add\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003eadd\u003c/b\u003e(\u003ci\u003edatum\u003c/i\u003e)\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/add.js \"Source\")\n\nAdds the specified *datum* to the binarytree, deriving its coordinates ⟨*x*⟩ using the current [*x*-](#binarytree_x)accessor, and returns the binarytree. If the new point is outside the current [extent](#binarytree_extent) of the binarytree, the binarytree is automatically expanded to [cover](#binarytree_cover) the new point.\n\n\u003ca name=\"binarytree_addAll\" href=\"#binarytree_addAll\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003eaddAll\u003c/b\u003e(\u003ci\u003edata\u003c/i\u003e)\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/add.js#L41 \"Source\")\n\nAdds the specified array of *data* to the binarytree, deriving each element’s coordinates ⟨*x*⟩ using the current [*x*-](#binarytree_x)accessor, and return this binarytree. This is approximately equivalent to calling [*binarytree*.add](#binarytree_add) repeatedly:\n\n```js\nfor (let i = 0, n = data.length; i \u003c n; ++i) {\n  binarytree.add(data[i]);\n}\n```\n\nHowever, this method results in a more compact binarytree because the extent of the *data* is computed first before adding the data.\n\n\u003ca name=\"binarytree_remove\" href=\"#binarytree_remove\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003eremove\u003c/b\u003e(\u003ci\u003edatum\u003c/i\u003e)\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/remove.js \"Source\")\n\nRemoves the specified *datum* to the binarytree, deriving its coordinates ⟨*x*⟩ using the current [*x*-](#binarytree_x)accessor, and returns the binarytree. If the specified *datum* does not exist in this binarytree, this method does nothing.\n\n\u003ca name=\"binarytree_removeAll\" href=\"#binarytree_removeAll\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003eremoveAll\u003c/b\u003e(\u003ci\u003edata\u003c/i\u003e)\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/remove.js#L53 \"Source\")\n\nRemoves the specified *data* from the binarytree, deriving their coordinates ⟨*x*⟩ using the current [*x*-](#binarytree_x)accessor, and returns the binarytree. If a specified *datum* does not exist in this binarytree, it is ignored.\n\n\u003ca name=\"binarytree_copy\" href=\"#binarytree_copy\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003ecopy\u003c/b\u003e()\n\nReturns a copy of the binarytree. All [nodes](#nodes) in the returned binarytree are identical copies of the corresponding node in the binarytree; however, any data in the binarytree is shared by reference and not copied.\n\n\u003ca name=\"binarytree_root\" href=\"#binarytree_root\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003eroot\u003c/b\u003e()\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/root.js \"Source\")\n\nReturns the root [node](#nodes) of the binarytree.\n\n\u003ca name=\"binarytree_data\" href=\"#binarytree_data\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003edata\u003c/b\u003e()\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/data.js \"Source\")\n\nReturns an array of all data in the binarytree.\n\n\u003ca name=\"binarytree_size\" href=\"#binarytree_size\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003esize\u003c/b\u003e()\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/size.js \"Source\")\n\nReturns the total number of data in the binarytree.\n\n\u003ca name=\"binarytree_find\" href=\"#binarytree_find\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003efind\u003c/b\u003e(\u003ci\u003ex\u003c/i\u003e[, \u003ci\u003eradius\u003c/i\u003e])\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/find.js \"Source\")\n\nReturns the datum closest to the position ⟨*x*⟩ with the given search *radius*. If *radius* is not specified, it defaults to infinity. If there is no datum within the search area, returns undefined.\n\n\u003ca name=\"binarytree_visit\" href=\"#binarytree_visit\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003evisit\u003c/b\u003e(\u003ci\u003ecallback\u003c/i\u003e)\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/visit.js \"Source\")\n\nVisits each [node](#nodes) in the binarytree in pre-order traversal, invoking the specified *callback* with arguments *node*, *x0*, *x1* for each node, where *node* is the node being visited, ⟨*x0*⟩ is the lower bound of the node, and ⟨*x1*⟩ is the upper bound, and returns the binarytree. (Assuming that positive *x* is right, ⟨*x0*⟩ is the left boundary and ⟨*x1*⟩ is the right boundary; however, the coordinate system is arbitrary, so more formally *x0* \u003c= *x1*.)\n\nIf the *callback* returns true for a given node, then the children of that node are not visited; otherwise, all child nodes are visited. This can be used to quickly visit only parts of the tree, for example when using the [Barnes–Hut approximation](https://en.wikipedia.org/wiki/Barnes–Hut_simulation). Note, however, that child segments are always visited in sibling order: left, right. In cases such as [search](#binarytree_find), visiting siblings in a specific order may be faster.\n\nAs an example, the following visits the binarytree and returns all the nodes within a range [xmin, xmax], ignoring segments that cannot possibly contain any such node:\n\n```js\nfunction search(binarytree, xmin, xmax) {\n  const results = [];\n  binarytree.visit(function(node, x1, x2) {\n    if (!node.length) {\n      do {\n        const d = node.data;\n        if (d[0] \u003e= xmin \u0026\u0026 d[0] \u003c xmax) {\n          results.push(d);\n        }\n      } while (node = node.next);\n    }\n    return x1 \u003e= xmax || x2 \u003c xmin;\n  });\n  return results;\n}\n```\n\n\u003ca name=\"binarytree_visitAfter\" href=\"#binarytree_visitAfter\"\u003e#\u003c/a\u003e \u003ci\u003ebinarytree\u003c/i\u003e.\u003cb\u003evisitAfter\u003c/b\u003e(\u003ci\u003ecallback\u003c/i\u003e)\n [\u003c\u003e](https://github.com/d3/d3-binarytree/blob/master/src/visitAfter.js \"Source\")\n\nVisits each [node](#nodes) in the binarytree in post-order traversal, invoking the specified *callback* with arguments *node*, *x0*, *x1* for each node, where *node* is the node being visited, ⟨*x0*⟩ is the lower bound of the node, and ⟨*x1*⟩ are the upper bound, and returns the binarytree. (Assuming that positive *x* is right, ⟨*x0*⟩ is the left boundary and ⟨*x1*⟩ is the right boundary; however, the coordinate system is arbitrary, so more formally *x0* \u003c= *x1*.) Returns *root*.\n\n### Nodes\n\nInternal nodes of the binarytree are represented as two-element arrays in left-to-right order:\n\n* `0` - the left half, if any.\n* `1` - the right half, if any.\n\nA child half may be undefined if it is empty.\n\nLeaf nodes are represented as objects with the following properties:\n\n* `data` - the data associated with this point, as passed to [*binarytree*.add](#binarytree_add).\n* `next` - the next datum in this leaf, if any.\n\nThe `length` property may be used to distinguish leaf nodes from internal nodes: it is undefined for leaf nodes, and 4 for internal nodes. For example, to iterate over all data in a leaf node:\n\n```js\nif (!node.length) do console.log(node.data); while (node = node.next);\n```\n\nThe point’s *x*--coordinate **must not be modified** while the point is in the binarytree. To update a point’s position, [remove](#binarytree_remove) the point and then re-[add](#binarytree_add) it to the binarytree at the new position. Alternatively, you may discard the existing binarytree entirely and create a new one from scratch; this may be more efficient if many of the points have moved.\n\n\n[npm-img]: https://img.shields.io/npm/v/d3-binarytree\n[npm-url]: https://npmjs.org/package/d3-binarytree\n[build-size-img]: https://img.shields.io/bundlephobia/minzip/d3-binarytree\n[build-size-url]: https://bundlephobia.com/result?p=d3-binarytree\n[npm-downloads-img]: https://img.shields.io/npm/dt/d3-binarytree\n[npm-downloads-url]: https://www.npmtrends.com/d3-binarytree\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvasturiano%2Fd3-binarytree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvasturiano%2Fd3-binarytree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvasturiano%2Fd3-binarytree/lists"}