C++ Implementation of Zip Trees
-
Updated
Nov 5, 2022 - C++
#
balanced-binary-search-tree
Here are 6 public repositories matching this topic...
A Python implementation of a self balancing binary search tree (AVL Tree). Useful to practice, study and see how the SBBTs works.
avl-tree binary-search-tree bst print-tree self-balancing-binary-search-tree balanced-binary-search-tree sbbst bbst learning-binary-trees
-
Updated
Jul 8, 2025 - Python
This repository offers a robust implementation of an AVL tree (balanced binary search tree) in Python, encapsulated within the Node and Tree classes. It includes methods for building the tree (build_tree()), inserting nodes (insert()), and deleting nodes (delete()). The implementation ensures that the tree remains balanced, optimizing performance.
python tree avl-tree algorithms data-structures binary-search-tree delete insert tree-traversal tree-construction balanced-binary-search-tree tree-rebalancing
-
Updated
Dec 22, 2024 - Python
Fast, type-safe Binary Search Trees (BST & RandBST). Zero-dependency data structures engineered for massive datasets and low-latency lookups.
typescript binary-search-tree bst randomized-binary-search-trees balanced-binary-search-tree bstrees
-
Updated
Feb 25, 2026 - TypeScript
-
Updated
Jun 14, 2026 - Swift
A project from my python class during my sophomore year, using COVID-19 data. Reads data from local files, performs linear search and quick sort on array of objects, builds balanced binary search tree and searches balanced BST.
-
Updated
Jan 31, 2021 - Python
Add this topic to your repo
To associate your repository with the balanced-binary-search-tree topic, visit your repo's landing page and select "manage topics."