Implementation of a basic phonebook using Balanced AVL trees
-
Updated
Nov 17, 2019 - C
#
avl-trees
Here are 9 public repositories matching this topic...
📚📊🔍Unlock the art of text analysis with Texticalysis: a C-based toolkit blending AVL trees and advanced algorithms for word frequencies, sentiment analysis, and discovering the Top M words in lexicographic order. 🚀🤖🌟
data-analysis frequency-analysis order-management c-programming avl-trees alphabetical-order self-balancing-algorithms gutenberg-library
-
Updated
Sep 1, 2023 - C
The purpose of the coursework is to develop an application for comparing and analyzing internal sorting algorithms.
-
Updated
Feb 8, 2022 - C++
Implementation of various useful data structures
-
Updated
Jan 24, 2022 - C++
SnapTrees is an interactive tool to visualize tree data structures and their operations like insertion, deletion, and search in real-time.
-
Updated
Nov 8, 2025 - TypeScript
MIT - 6.006 - Undergraduate Introduction to Algorithms - Spring 2020
hashing sorting algorithms graph-algorithms recursion data-structures dijkstra dynamic-programming shortest-paths binary-trees breadth-first-search depth-first-search complexity-analysis bellman-ford avl-trees binary-heaps linear-sorting pseudopolynomial-time
-
Updated
Apr 3, 2025 - Python
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.
javascript golang avl-tree balance webassembly wasm binary-search-tree balanced-tree bst avl datatype wasm-modules avl-trees wasm-exec
-
Updated
Sep 22, 2021 - Go
Improve this page
Add a description, image, and links to the avl-trees topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the avl-trees topic, visit your repo's landing page and select "manage topics."