A collection of powerful data structures
-
Updated
Aug 12, 2022 - Java
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
TreeKEM Library in JavaScript, Focusing on Generalization
Self balancing binary tree with logarithmic amortized time of CRUD operations
Some interesting problems I solved on competition platforms such as codeforces
Advanced Algorithms and Data Structures FER labs
This is a projects with implementation of different algorithms & data structures in C#.
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
This file has code of trees I learned in my programming classes.
Implementation of a generic AVL Tree in Go. Intended to be used as a WASM module, though is perfectly functional as a standard Golang library.
load data from .txt file and build balanced and avl trees (CODE) [ C++ ]
Add a description, image, and links to the balanced-tree topic page so that developers can more easily learn about it.
To associate your repository with the balanced-tree topic, visit your repo's landing page and select "manage topics."