GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
go map golang set list tree data-structure avl-tree stack queue iterator sort red-black-tree enumerable binary-heap b-tree
- Updated
- Go
#
red-black-tree
Here are 483 public repositories matching this topic...
2021年最新总结 500个常用数据结构，算法，算法导论，面试常用，大厂高级工程师整理总结
- Updated
- C
100+ algorithms & data structures generically implemented in C#
csharp avl-tree algorithms graph-algorithms data-structures red-black-tree sorting-algorithms heap binary-trees quadtree pairing-heap rtree btrees splaytrees fibonacci-heap treaps
- Updated
- C#
A javascript standard data structure library which benchmark against C++ STL.
javascript map set typescript priority-queue javascript-library data-structures hashmap red-black-tree hashset stl-containers deque dequeue linklist data-structures-and-algorithms rb-tree data-structure-library javascript-data-structures typescript-data-structure hashsets
- Updated
- TypeScript
A library of generic intrusive data structures and algorithms in ANSI C
c linked-list stack queue algorithms datastructures generic hash-functions collections red-black-tree hashtable c89 ansi-c iterative-algorithms intrusive cdsa
- Updated
- C
High-performance immutable data structures for modern JavaScript and TypeScript applications. Functional interfaces, deep/composite operations API, mixed mutability API, TypeScript definitions, ES2015 module exports.
javascript map set list typescript immutable dictionary deep nested-structures javascript-library batching data-structures immutablejs typescript-definitions red-black-tree es2015-modules hash-array-mapped-trie sorted-set sorted-map
- Updated
- TypeScript
TypeScript & Javascript Data Structures
javascript typescript avl-tree linked-list leetcode graph trie priority-queue hash-map data-structures binary-tree red-black-tree heap segment-tree deque skip-list zero-dependencies tree-map sorted-collections tree-set
- Updated
- TypeScript
The go-set package provides generic Set implementations for Go, including HashSet for types with a Hash() function and TreeSet for orderable data
- Updated
- Go
BokkyPooBah's Red-Black Binary Search Tree Library
- Updated
- Solidity
An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
data-structure cpp14 red-black-tree interval-tree segment-tree search-trees interval-set interval-map zip-tree weight-balanced-tree
- Updated
- C++
Java implementation for Introduction to Algorithms book.
java tree select data-structure algorithms red-black-tree sorting-algorithms dynamic-programming btree introduction-to-algorithms search-tree bfprt
- Updated
- Java
Lua algorithms library that covers commonly used data structures and algorithms
sorting lua algorithms data-structures binary-search-tree red-black-tree balanced-search-trees tries
- Updated
- Lua
A C++ header only interval tree implementation.
- Updated
- C++
GoDS-Generic (Go Generic Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
go map golang set list tree avl-tree stack queue iterator generic sort data-structures red-black-tree enumerable binary-heap b-tree go-generics golang-generics
- Updated
- Go
Generic sorted map for Go with red-black tree under the hood
go map golang container treemap red-black-tree tree-structure golang-library golang-package sorted-map gotemplate
- Updated
- Go
🔗 Common Data Structures and Algorithms
list tree algorithm data-structure algorithms octree hash binary-search-tree red-black-tree rbtree hash-table balanced-search-trees search-trees libds algorithms-datastructures forward-list
- Updated
- C
extra-collections (or extra for short) is a python3 package that provides a pythonic, intuitive, and easy implementation of the most common data structures used in software projects.
avl-tree linked-list stack queue trie data-structures binary-search-tree red-black-tree heap tree-structure bst radix-trie deque doubly-linked-list circular-linked-list treap skip-list splay-tree suffix-trie
- Updated
- Python
A set of efficient data structures in C, created in a generic way
c stack queue graph bloom-filter priority-queue hash-functions data-structures red-black-tree heap abstract-data-types hash-table prim-algorithm separate-chaining weighted-graphs abstract-data-structures utility-functions double-hashing void-pointers
- Updated
- C
Improve this page
Add a description, image, and links to the red-black-tree topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the red-black-tree topic, visit your repo's landing page and select "manage topics."