15 best open source avl tree projects.

We have collection of more than 1 Million open source products ranging from Enterprise product to small libraries in all platforms. We aggregate information from all open source repositories. Search and find the best for your needs. Check out projects section.

Displaying 1 to 15 from 15 results

gods - GoDS (Go Data Structures)

Implementation of various data structures and algorithms in Go.Containers are either ordered or unordered. All ordered containers provide stateful iterators and some of them allow enumerable functions.

data-structure map tree set list stack iterator enumerable sort avl-tree red-black-tree b-tree binary-heap collections go-collection

javascript-datastructures-algorithms - :books: collection of JavaScript data structures and algorithms for education purposes

Javascript

Source code of Learning JavaScript Data Structures and Algorithms book.

javascript-algorithms algorithm data-structures typescript typescript-algorithms stack queue deque priority-queue linked-list set tree sorting-algorithms dictionary binary-tree avl-tree quicksort graph graph-algorithms dijkstra-algorithm

libfastcommon - c common functions library extracted from my open source project FastDFS

c common functions library extracted from my open source project FastDFS. this library is very simple and stable. functions including: string, logger, chain, hash, socket, ini file reader, base64 encode / decode, url encode / decode, fast timer, skiplist, object pool etc. detail info please see the c header files.

c-library fastdfs id-generator ini-parser skiplist avl-tree object-pool connection-pool socket-io process-control task-scheduler system-info

Towel - Throw in the towel.

CSharp

Note This project has a goal of keeping up-to-date on modern coding practices rather than maintaining backwards compatibility such as targetting the latest non-preview version of .NET and embracing favorable breaking changes ("Semantic Versioning" is not being respected at this time). Towel has Examples included in this repository.

console library algorithm framework avl-tree command-line extensions random mathematics data-structures measurements red-black-trees algorithms-and-data-structures towel towel-nuget

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-tree binary-search-tree self-balancing

libdict - C library of key-value data structures.

All data structures in this library support insert, search, and remove, and have bidirectional iterators. The sorted data structures (everything but hash tables) support near-search operations: searching for the key greater or equal to, strictly greater than, lesser or equal to, or strictly less than, a given key. The tree data structures also support the selecting the nth element, which generally takes linear time, but only takes logarithmic time in path-reduction and weight-balanced trees. The API is designed with efficiency as a primary concern. For example, an insert call returns a boolean indicating whether or not the key was already present in the dictionary (i.e. whether there was an insertion or a collision), and a pointer to the location of the associated data. Thus, an insert-or-update operation can be supported with a single traversal of the data structure. In addition, the code is written to be very efficient, and almost all recursive algorithms have been rewritten to use iteration instead.

tree binarytree map hashtable avl-tree redblacktree iterator dictionary associative-array splay-trees treaps hashing key-value skiplist data-structures

data-structures - Go datastructures.

Copyright 2013, Licensed under the GPL version 2. Please reach out to me directly if you require another licensing option. I am willing to work with you. To collect many important data structures for usage in go programs. Golang's standard library lacks many useful and important structures. This library attempts to fill the gap. I have implemented data-structure's as I have needed them. If there is a missing structure or even just a missing (or incorrect) method open an issue, send a pull request, or send an email patch.

data-structures avl-tree avl immutable btree hashtable hash-tables linear-hash-table trie ternary-search-trie arraylist linked-list priority-queue exceptions error-handling tree

AVL-Tree - Implementation of an AVL tree in Java

Java

Implementation of an AVL Tree, along with code to test insertions on the tree. Based on code written by Mark Allen Weiss in his book Data Structures and Algorithm Analysis in Java.

avl-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

leafy - a library of different tree implementations that can be used in both the browser and node

Javascript

leafy is a library of different tree implementations. leafy can be used in both the browser and node. Why would I need a tree in javascript? I have arrays and objects.

datastructures tree avl avl-tree red-black-tree andersson-tree

DataStructures - A collection of Data Structures implemented in Swift.

Swift

A collection of data structures implemented in Swift. All collection types are implemented as structures with the exception of the LinkedList data structure. This means they are copied when they are assigned to a new constant or variable, or when they are passed to a function or method.

datastructures swift-3 linkedlist stack queue priority-queue red-black-trees bimap bloom-filter multimap binary-heap trie avl-tree graph

forest - :deciduous_tree: Template Library of Tree Data Structures in C++17

: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

Advanced-Algorithms - 100+ algorithms & data structures generically implemented in C#.

CSharp

Please don't take effort to create pull requests for new algorithms/data structures. This is just a curiosity driven personal hobby and was originally not intented to be a library. Feel free fork and modify to fit your need if that's what you are looking for. You can however open issues/fix bugs with pull requests here, I would be happy to take a look when I get time. Various important computer science algorithms generically implemented in C#.

algorithms binary-trees heap sorting-algorithms avl-tree red-black-tree fibonacci-heap pairing-heap splaytrees treaps btrees graph-algorithms rtree quadtree

go-avltree - AVL tree with some useful extensions written in Go

An AVL tree (Adel'son-Vel'skii & Landis) is a binary search tree in which the heights of the left and right subtrees of the root differ by at most one and in which the left and right subtrees are again AVL trees. With each node of an AVL tree is associated a balance factor that is Left High, Equal, or Right High according, respectively, as the left subtree has height greater than, equal to, or less than that of the right subtree.

tree avl-tree