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

Some interesting problems I solved on competition platforms such as codeforces

Self balancing binary tree with logarithmic amortized time of CRUD operations

TreeKEM Library in JavaScript, Focusing on Generalization

Advanced Algorithms and Data Structures FER labs

Balanced Tree Visualizer is a dynamic, interactive tool designed to help you understand balanced binary search trees. Whether you’re learning about AVL trees or Red-Black trees, this application provides a visually engaging way to explore tree operations and traversals.

This is a projects with implementation of different algorithms & data structures in C#.

Assignment 2 Phase 1 (BKU Tree) for Data Structures & Algorithms (CO2003) - Semester 201 - HCMUT

Sorted dictionary base on AVL tree, search O(1)/ delete O(1) / insert O(logN)

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++ ]