SPOJ solutions (user: mahmud2690)

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

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.

Advanced algorithm and data structure library in C++

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

golang persistent immutable treap sorted sets

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.

Memory-effficient immutable collection types for Kotlin

🍃 🌳 🍂 Efficient implementation of the implicit treap data structure

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

A thread-safe, persistent Treap (tree + heap) for ordered key-value mapping and priority sorting.

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

Utility and useful structures for Rust

Abstract Treap-based sparse matrix library

Лабораторные работу по курсу ФИЛП МатМех УрФУ весна 2023

Treap Collection implementation

A new algorithm for insertion in persistent balanced binary search trees (BST) on non-volatile memory (PMEM).

Treap Binary Search Tree

Implementions of several different algorithms for storing, querying, and modifying ordered data in Binary trees and variants