🪢 A fast native data type for manipulating large strings in Redis

Advanced algorithm and data structure library in 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.

Tree Visualization Tool for Learning Data Structure and Algorithm.

Fortune's Algorithm O(N log N) for ICPC

Various containers written for C programmers who need complete control over their memory.

With the help of splay tree data structure, we would create a tree whose nodes are embedded with the Ip address of the device that are connect to a specific network router.

Lightweight Splay tree javascript library

Tree data structures implemented in Rust

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

A custom container built in C++ which is compatible with the STL library

A collection of powerful data structures are using java

Automated Amortised Complexity Analysis of Self-Adjusting Data Structures

A set of useful C libraries in single header file

A library of algorithms and data structures for the Free Pascal Compiler.

An RFID middleware to replace Fosstrak F&C.

A Splay tree implementation in C++. It uses bottom up approach for the splay operation.

Zero-dependency Piece Table Package for dart

Implementation of splay tree data structure

AVL Tree, RedBlack Tree and Splay Tree visualization in Qt

Splay tree is a binary search tree with splay operation.

Go implementation of tree data structure

OCR reading assistant with opencv, Tesseract, kraken, DAWGs and a splay tree

Implementations of most algorithms learnt in the course UE18CS311

Common Data Structures And Algorithms Implemented In C++. FOR LEARNING PURPOSES ONLY

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

No description provided.

Self balancing binary tree with logarithmic amortized time of CRUD operations

This repository is a workshop for heap allocator implementations using a variety of data structures and algorithms. The goal is to compare performance and tradeoffs of different approaches in depth.

Binary Search Trees, Splay Trees and Red Black Trees implemented in C