This is an implementation of a Concurrent K-Ary leaf oriented Search Tree. In this implementation, rely on Java's Garbage Collector to recycle the nodes that are removed from the tree as part of Insertion/Deletion process.
-
Notifications
You must be signed in to change notification settings - Fork 1
This is an implementation of a Concurrent K-Ary leaf oriented Search Tree. In this implementation, rely on Java's Garbage Collector to recycle the nodes that are removed from the tree as part of Insertion/Deletion process.
anandjbangad/Non-Blocking-K-ary-N-ary-search-tree
About
This is an implementation of a Concurrent K-Ary leaf oriented Search Tree. In this implementation, rely on Java's Garbage Collector to recycle the nodes that are removed from the tree as part of Insertion/Deletion process.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published