Displaying 1 to 7 from 7 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.

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.

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.

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).

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.

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.

We have large collection of open source products. Follow the tags from Tag Cloud >>

Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.