binarytree - Python Library for Studying Binary Trees

•    Python

---

Binarytree is a Python library which provides a simple API to generate, visualize, inspect and manipulate binary trees. It allows you to skip the tedious work of setting up test data, and dive straight into practising your algorithms. Heaps and BSTs (binary search trees) are also supported. You may need to use sudo depending on your environment.

python3 python2 python-3 python-2 python-library binary-trees binary-tree interview-practice interview learning practise python-3-5 algorithm data-structures data-structure heap heaps bst binary-search-tree

avl - :eyeglasses: Fast AVL tree for Node and browser

•    Javascript

---

Or use the compiled version 'dist/avl.js'. The comparator function is extremely important, in case of errors you might end up with a wrongly constructed tree or would not be able to retrieve your items. It is crucial to test the return values of your comparator(a,b) and comparator(b,a) to make sure it's working correctly, otherwise you may have bugs that are very unpredictable and hard to catch.

data-structure tree binary-search-tree algorithms avl-tree balanced-search-trees binary-tree bst avl balanced-search-tree

bbtree - Self-balancing Binary Search Trees in JavaScript

•    Javascript

---

This repo contains several simple balanced binary search tree JavaScript implementations to experiment, benchmark and play with. Benchmarks contain comparisons with functional-red-black-tree and js_bintrees.

tree binary bst andersson search data structure

js-strange - Range object for JavaScript

•    Javascript

---

stRange.js is a range object for JavaScript. Use it to have a single value type with two endpoints and their boundaries. Also implements an interval tree for quick lookups. Stringifies itself in the style of [begin,end) and allows you to parse a string back. Also useful with PostgreSQL. stRange.js follows semantic versioning, so feel free to depend on its major version with something like >= 1.0.0 < 2 (a.k.a ^1.0.0).

range ranges interval interval-tree bst integer integers sort bounds math

node-treap - Treap data structure implementation for Node.js and the browser

•    Javascript

---

Treaps are self-balancing binary trees which combine the properties of heaps and binary search trees. Each node has a key, which follows binary search tree ordering, and a priority, which follows heap ordering. Treaps can be used to efficiently implement sets and sorted lists, among other things. ###create() Factory method to initialize a new, empty treap.

treap tree binary-search-tree bst data-structure

burst-trie - js impl of a burst trie

•    Javascript

---

js impl of a burst trie

burst trie tree bst binary-search-tree

data-structures - Fast, light and hassle-free JavaScript data structures, written in CoffeeScript.

•    Javascript

---

Fast, light and hassle-free JavaScript data structures, written in CoffeeScript. Alternatively, you can directly use the compiled JavaScript version in the "distribution" folder. It's always in sync with the CoffeeScript one.

data-structure linked-list list bst binary-search-tree red-black-tree tree graph edge queue map hash heap trie