Displaying 1 to 12 from 12 results

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.

node-binary-search-tree - Self-balancing binary search tree for Node.js (uses AVL tree)

  •    Javascript

Note: this module is not actively maintained bar for bug fixes. Its primary use is within NeDB and I do not plan on adding any new features.Two implementations of binary search tree: basic and AVL (a kind of self-balancing binmary search tree). I wrote this module primarily to store indexes for NeDB (a javascript dependency-less database).

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.




gb_merkle_trees - General balanced binary Merkle trees for Erlang

  •    Erlang

An Erlang library that provides a dictionary-like storage for binaries using general balanced binary Merkle trees, with an interface similar to gb_trees. This library uses semantic versioning 2.0. If a change causes different root hashes to be generated for the same input data when entering or deleting, it is considered backwards incompatible.

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.

Containers - A library of binary tree data structures (bstree, dstree, trie, crit-bit, PATRICIA) implemented in C

  •    C

This is a library of associative array data structures implemented as binary trees in C. Each have their own strengths and (dis)advantages.


rs_teardown_tree - A BST (binary search tree) that supports fast clone, query and delete-range operations

  •    Rust

Two data structures are currently implemented: TeardownTree and IntervalTeardownTree (an augmented Interval Tree), both with conventional Map and Set interfaces. The tree does not use any kind of self-balancing and does not support insert operation.

sweepline - Fortune's algorithm for Voronoi diagram generating on the plane

  •    C++

Fortune's algorithm for Voronoi diagram generating on the plane. Intended for runtime speed and careful handling of corner cases.

agda-from-nothing-2017 - Agda from Nothing: Order in the Types

  •    Agda

A workshop for learning Agda with minimal prequisites. The focus of this version of "Agda from Nothing" is on creating correct-by-construction binary search trees. The outline and code follows the paper How to Keep Your Neighbours in Order by Conor McBride (2014) [PDF]. This workshop uses Agda 2.5.2, though I expect code to work on older versions.

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.