charlesbrtl /
CUSTOM_AVL_TREE
custom java implementation of AVL balancing trees
37/100 healthActive repository
JavaMIT
⑂ 0 forks◯ 0 issuesUpdated Apr 5, 2018
Loading repository data…
Loading repository data…
Ishkhanants / repository
Custom implementation of self-balancing binary search tree (BST) with AVL algorithm.
A transparent discovery signal based on current public GitHub metadata.
This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
Custom implementation of self-balancing binary search tree (BST) with AVL algorithm, which means the difference between heights of left and right subtrees cannot be more than one for all nodes. To not deviate from this idea we augment the standard BST insert and delete operations with some re-balancing. Depending on case we rotate tree to needed direction. It allows us to take O(h) time in most of BST operations, where h is height of tree.
Selected from shared topics, language and repository description—not editorial ratings.
charlesbrtl /
custom java implementation of AVL balancing trees
37/100 healthtomerba6 /
Java implementations of a Dynamic Set ADT, AVL Trees, and custom time-complexity optimized data structures: Chronological AVL Tree and Product Inventory System
49/100 healthLayanAlomar /
Java implementation of an e-commerce management system using custom data structures including Linked Lists, Linked Priority Queue, and AVL Trees without Java Collections
/100 healthKhaled-TE /
Educational implementations of core data structures from scratch in Java and Python. Includes a min-heap, custom linked list, custom stack with a min-stack variant, a priority queue built from two stacks, a BST, and a self-balancing AVL tree.
49/100 healthSIvan800 /
Java implementations of advanced data structures. Includes a Dynamic Set ADT (with search, insert, delete, successor, predecessor, min, max), extensions of arrays, linked lists, and AVL trees, and two custom-designed data structures: one supporting efficient order-based operations, and another for product management with quality/price analytics.
48/100 healthnoaioshpe /
Project in Data Structures Course - implementation of advanced data structures in Java, including hash tables and AVL trees. The first part involves a hash table for storing spells with custom hashing functions, while the second part integrates a hash table with AVL trees to efficiently rank and retrieve the most powerful spells.
27/100 health