{"id":16642130,"url":"https://github.com/make-github-pseudonymous-again/js-bst","last_synced_at":"2025-12-12T03:30:25.291Z","repository":{"id":22624003,"uuid":"25966516","full_name":"make-github-pseudonymous-again/js-bst","owner":"make-github-pseudonymous-again","description":":seedling: Binary search tree library in JavaScript","archived":false,"fork":false,"pushed_at":"2021-04-26T14:08:46.000Z","size":2452,"stargazers_count":1,"open_issues_count":9,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-04-13T09:58:44.101Z","etag":null,"topics":["agpl","binary-search-trees","computer-science","data-structures","javascript","search-trees","searching","sorting","tree"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"agpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/make-github-pseudonymous-again.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}},"created_at":"2014-10-30T10:52:54.000Z","updated_at":"2021-12-20T23:41:00.000Z","dependencies_parsed_at":"2022-08-22T23:10:33.152Z","dependency_job_id":null,"html_url":"https://github.com/make-github-pseudonymous-again/js-bst","commit_stats":null,"previous_names":["aureooms/js-bst"],"tags_count":26,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/make-github-pseudonymous-again%2Fjs-bst","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/make-github-pseudonymous-again%2Fjs-bst/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/make-github-pseudonymous-again%2Fjs-bst/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/make-github-pseudonymous-again%2Fjs-bst/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/make-github-pseudonymous-again","download_url":"https://codeload.github.com/make-github-pseudonymous-again/js-bst/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247273994,"owners_count":20912029,"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","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":["agpl","binary-search-trees","computer-science","data-structures","javascript","search-trees","searching","sorting","tree"],"created_at":"2024-10-12T07:48:56.820Z","updated_at":"2025-12-12T03:30:25.253Z","avatar_url":"https://github.com/make-github-pseudonymous-again.png","language":"JavaScript","readme":":seedling: [@aureooms/js-bst](https://make-github-pseudonymous-again.github.io/js-bst)\n[![License](https://img.shields.io/github/license/make-github-pseudonymous-again/js-bst.svg)](https://raw.githubusercontent.com/make-github-pseudonymous-again/js-bst/main/LICENSE)\n[![GitHub issues](https://img.shields.io/github/issues/make-github-pseudonymous-again/js-bst.svg)](https://github.com/make-github-pseudonymous-again/js-bst/issues)\n==\n\n\u003cimg src=\"https://ipfs.io/ipfs/QmV3bHSMRbNYydNxpyuke659Nj89UsVcuSyZXibogw4sJ9\" width=\"864\"\u003e\n\nBinary search tree data structures for JavaScript.\nSee [docs](https://make-github-pseudonymous-again.github.io/js-bst).\nParent is [@aureooms/js-data-structures](https://github.com/make-github-pseudonymous-again/js-data-structures).\n\n## Description\n\nThis README regroups projects focusing on implementing search tree data\nstructures with JavaScript.\nThis project itself does not contain any code.\n\n### :baby: Children\n\n  - [x] [@aureooms/js-red-black-tree](https://github.com/make-github-pseudonymous-again/js-red-black-tree)\n  - [ ] [@aureooms/js-splay-tree](https://github.com/make-github-pseudonymous-again/js-splay-tree)\n  - [ ] [@aureooms/js-avl-tree](https://github.com/make-github-pseudonymous-again/js-avl-tree)\n  - [ ] [2-3 tree](https://github.com/make-github-pseudonymous-again/js-bst/issues/2)\n  - [ ] [2-3-4 tree](https://github.com/make-github-pseudonymous-again/js-bst/issues/15)\n  - [ ] [AA tree](https://github.com/make-github-pseudonymous-again/js-bst/issues/3)\n  - [ ] [Scapegoat tree](https://github.com/make-github-pseudonymous-again/js-bst/issues/5)\n  - [ ] [Treap](https://github.com/make-github-pseudonymous-again/js-bst/issues/7)\n  - [ ] [Randomized binary search tree](https://github.com/make-github-pseudonymous-again/js-bst/issues/9)\n\n## :scroll: Reference\n\n  - https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree#Implementations\n  - http://opendatastructures.org/ods-java/7_Random_Binary_Search_Tree.html\n  - https://github.com/mikolalysenko/functional-red-black-tree\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmake-github-pseudonymous-again%2Fjs-bst","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmake-github-pseudonymous-again%2Fjs-bst","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmake-github-pseudonymous-again%2Fjs-bst/lists"}