GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
-
Updated
Mar 12, 2025 - Go
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
2021年最新总结 500个常用数据结构,算法,算法导论,面试常用,大厂高级工程师整理总结
100+ algorithms & data structures generically implemented in C#
A javascript standard data structure library which benchmark against C++ STL.
A library of generic intrusive data structures and algorithms in ANSI 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.
TypeScript & Javascript Data Structures
The go-set package provides generic Set implementations for Go, including HashSet for types with a Hash() function and TreeSet for orderable data
BokkyPooBah's Red-Black Binary Search Tree Library
An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
Java implementation for Introduction to Algorithms book.
Lua algorithms library that covers commonly used data structures and algorithms
A C++ header only interval tree implementation.
GoDS-Generic (Go Generic Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
Generic sorted map for Go with red-black tree under the hood
🔗 Common Data Structures and Algorithms
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.
A set of efficient data structures in C, created in a generic way
Add a description, image, and links to the red-black-tree topic page so that developers can more easily learn about it.
To associate your repository with the red-black-tree topic, visit your repo's landing page and select "manage topics."