Python implementation set for search algorithms and data structures, covering balanced trees, hashing, skip lists, tries, and ordered traversal validation.
-
Updated
Jul 4, 2026 - Python
Python implementation set for search algorithms and data structures, covering balanced trees, hashing, skip lists, tries, and ordered traversal validation.
This repository is all about data structures, its implementation, problem and solving
🌲 A C++ implementation of all functionalities (insertion, deletion, search etc) of a 2-3 (two-three) Tree using Rotation, Split and Merge operations. (Please share if you find any bug in the code)
C library for self-balancing trees.
Data Structures 👩💻 Domain on HackerRank - Problems & Solutions 📑📘
An AVL-Tree Visualizer
A red-black self-balancing interval tree
Balanced Binary Tree Word Finder
General balanced binary Merkle trees for Erlang
A wide range of (basic) data structures, implemented in simple, readable Java.
C++ implementation of various balanced trees
🌳 Implementation of self-balancing trees in Elm
To associate your repository with the balanced-trees topic, visit your repo's landing page and select "manage topics."