🔧 Build a high-performance, configurable B+ tree for persistent key-value storage with pluggable backends and full Rust type safety.
-
Updated
May 1, 2026 - Rust
🔧 Build a high-performance, configurable B+ tree for persistent key-value storage with pluggable backends and full Rust type safety.
🌳 Build and explore tree data structures in Java, with implementations that support learning and extendable utilities for advanced projects.
MGE General C Library
This mini-project implements a balanced binary search tree (BST) in JavaScript. A BST allows for fast operations when looking up, inserting, and deleting data items.
Collection of LeetCode questions to ace the coding interview!
Data structures and algorithms are not just theoretical ideas but can be practically applied to real-world situations. This includes using them to optimize database queries and solve complex coding problems.
A Java based task manager with a database system and multiple data structures
Collection of data structure implementations in Java
C++ contact book using a binary search tree with efficient search, edit, and delete operations. Extends the structure with message and share history managed by move-to-front and transposition heuristics for realistic access behavior in a messaging app.
Comprehensive Java implementations of N-ary trees, binary search trees, AVL self-balancing trees, and B-Trees.
Binary Search Tree (BST) in Python – A simple, well-documented implementation of a binary search tree with insert, remove, search, and traversal methods. Includes example usage and test script.
Esse repositório contém materiais e atividades desenvolvidas durante o curso da faculdade sobre estruturas de dados. Todos os algoritmos desse repositório foram escritos em Java.
A graphical visualizer for self-balancing binary search trees (AVL, Splay) with extensible architecture, implemented in C++ and Qt/QML. The project lets you explore insert, delete, and search operations step by step, visualize tree rotations, and observe internal state changes.
AVL (self-balancing binary) trees implemented using Pygame
A simple binary search tree implementation with Assembly (x86-64, NASM)
Implementation of various basic data structures from scratch in C
My Data Structures Implementation, This repository contains implementations of fundamental data structures written from scratch. The goal is to understand their inner workings, optimize performance, and reinforce problem-solving skills.
A mini desktop search engine in Java that quickly searches a document collection for specific keywords and returns matching documents using efficient data structures and algorithms.
Add a description, image, and links to the bstree topic page so that developers can more easily learn about it.
To associate your repository with the bstree topic, visit your repo's landing page and select "manage topics."