A collection of powerful data structures
Storage algorithms.
A red-black self-balancing interval tree
General balanced binary Merkle trees for Erlang
Object-oriented projects created in C++ and Java. Utilizes data structure concepts and inheritance.
An implementation of a balanced 2,3-tree that allows accessing next/previous elements in O(1) at all times.
An efficient and generic implementation of a balanced AVL Tree in native Swift.
Implementation of data structures in GO.
Purely functional data structures
Self balancing binary tree with logarithmic amortized time of CRUD operations
TreeKEM Library in JavaScript, Focusing on Generalization
Some interesting problems I solved on competition platforms such as codeforces
This is a projects with implementation of different algorithms & data structures in C#.
Advanced Algorithms and Data Structures FER labs
Sorted dictionary base on AVL tree, search O(1)/ delete O(1) / insert O(logN)
Assignment 2 Phase 1 (BKU Tree) for Data Structures & Algorithms (CO2003) - Semester 201 - HCMUT
Self balancing binary tree in C++
MySQL solutions to Danny Ma's 8 Week SQL Challenge — covering CTEs, window functions, recursive queries, stored procedures, and JSON extraction across 8 different business domains.
To associate your repository with the balanced-tree topic, visit your repo's landing page and select "manage topics."