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.
-
Notifications
You must be signed in to change notification settings - Fork 1
Ishkhanants/java-avl-treeset
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Custom implementation of self-balancing binary search tree (BST) with AVL algorithm.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published