Displaying 1 to 16 from 16 results

Buckets is a complete, fully tested and documented data structure library written in pure JavaScript.

data-structures collections collection linked-list dictionary map multimap stack queue set bag binary-heap priority-queue binary-search binary-search-tree tree tree-structure buckets data structure linked list heap priority binary data-structure hashmapBinarytree 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-treeIP geolocation binary tree search

binary-search-tree ip-geolocation ip-database ipaddressNote: 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-tree binary-search-tree self-balancingOr 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-treeAn 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.

merkle-tree merkle binary-search-tree tree balanced-trees balanced-tree cryptocurrency blockchainTreaps 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-structureThis is a library of associative array data structures implemented as binary trees in C. Each have their own strengths and (dis)advantages.

data-structures trees trie patricia-tree crit-bit-tree binary-search-treeTwo 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.

binary-search-tree teardown delete-range range-query bulk-operation pointer-freeFortune's algorithm for Voronoi diagram generating on the plane. Intended for runtime speed and careful handling of corner cases.

voronoi-diagram geometric-algorithms gnuplot red-black-tree binary-search-treeData Structures with Go Language

data-stuctures golang-examples arrays binary-trees linked-list graph-algorithms interview-questions collections stack queue binary-search-tree binary-search tree sorting-algorithms dictionary algorithms educational searching-algorithmsA 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.

agda workshop learning-agda binary-search-tree data-structure dependent-typesProblems are from: Hackerrank, Leetcode, codility and random problems that I find on Internet. Every end folder (or folder leaf) has the same name of the problem.

hackerrank-solutions hackerrank algorithms data-structures graphs trees trie dfs bfs regular-expressions sorting-algorithms binary-search captcha-solving minimax-algorithm binary-search-treeFast, 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:deciduous_tree: Template Library of Tree Data Structures in C++17

template-library header-only avl-tree data-structures library binary-search-tree cmake cpp cpp17
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.**