Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/make-github-pseudonymous-again/js-bst

:seedling: Binary search tree library in JavaScript
https://github.com/make-github-pseudonymous-again/js-bst

agpl binary-search-trees computer-science data-structures javascript search-trees searching sorting tree

Last synced: about 1 month ago
JSON representation

:seedling: Binary search tree library in JavaScript

Host: GitHub
URL: https://github.com/make-github-pseudonymous-again/js-bst
Owner: make-github-pseudonymous-again
License: agpl-3.0
Created: 2014-10-30T10:52:54.000Z (about 10 years ago)
Default Branch: main
Last Pushed: 2021-04-26T14:08:46.000Z (over 3 years ago)
Last Synced: 2024-04-13T09:58:44.101Z (7 months ago)
Topics: agpl, binary-search-trees, computer-science, data-structures, javascript, search-trees, searching, sorting, tree
Language: JavaScript
Homepage:
Size: 2.34 MB
Stars: 1
Watchers: 1
Forks: 0
Open Issues: 9
Metadata Files:
- Readme: README.md
- License: LICENSE

Awesome Lists containing this project

README

        :seedling: [@aureooms/js-bst](https://make-github-pseudonymous-again.github.io/js-bst)

[![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)

[![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)

==



Binary search tree data structures for JavaScript.

See [docs](https://make-github-pseudonymous-again.github.io/js-bst).

Parent is [@aureooms/js-data-structures](https://github.com/make-github-pseudonymous-again/js-data-structures).

## Description

This README regroups projects focusing on implementing search tree data

structures with JavaScript.

This project itself does not contain any code.

### :baby: Children

  - [x] [@aureooms/js-red-black-tree](https://github.com/make-github-pseudonymous-again/js-red-black-tree)

  - [ ] [@aureooms/js-splay-tree](https://github.com/make-github-pseudonymous-again/js-splay-tree)

  - [ ] [@aureooms/js-avl-tree](https://github.com/make-github-pseudonymous-again/js-avl-tree)

  - [ ] [2-3 tree](https://github.com/make-github-pseudonymous-again/js-bst/issues/2)

  - [ ] [2-3-4 tree](https://github.com/make-github-pseudonymous-again/js-bst/issues/15)

  - [ ] [AA tree](https://github.com/make-github-pseudonymous-again/js-bst/issues/3)

  - [ ] [Scapegoat tree](https://github.com/make-github-pseudonymous-again/js-bst/issues/5)

  - [ ] [Treap](https://github.com/make-github-pseudonymous-again/js-bst/issues/7)

  - [ ] [Randomized binary search tree](https://github.com/make-github-pseudonymous-again/js-bst/issues/9)

## :scroll: Reference

  - https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree#Implementations

  - http://opendatastructures.org/ods-java/7_Random_Binary_Search_Tree.html

  - https://github.com/mikolalysenko/functional-red-black-tree