nsteps / non-blocking-k-ary-n-ary-search-tree Goto Github PK
View Code? Open in Web Editor NEWThis project forked from anandjbangad/non-blocking-k-ary-n-ary-search-tree
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.