Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci

SPOJ solutions (user: mahmud2690)

Advanced algorithm and data structure library in C++

🍃 🌳 🍂 Efficient implementation of the implicit treap data structure

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 thread-safe, persistent Treap (tree + heap) for ordered key-value mapping and priority sorting.

golang persistent immutable treap sorted sets

Utility and useful structures for Rust

My personal code collection of algorithms, data structures, and design patterns in C++ and Python.

fast IP to CIDR lookup, longest prefix match in golang

Social Networking is a smart social networking system that aims to compete with Facebook. It allows users to create profiles, add friends, search for other users, and get recommendations for new friends.

C++ implementations of real time dynamic planar convex hull construction algorithms.

generic, fast lookup on one dimensional intervals. The implementation is based on treaps, augmented for intervals. Treaps are randomized self balancing binary search trees.

Multifunctional tree visualizer that with implementation of red-black, avl, splay trees and treap

Order Statistic Tree based on 🌿 Treap data structure.

Memory-effficient immutable collection types for Kotlin

Treap Collection implementation

Finite set implementation in scheme language

Implementation of some popular Balanced Binary Search Trees (AVL, RBT, Splay, Treap) and Performance Comparison

用golang语言实现的STL,在高并发时实现了线程安全