95daa67471
Tree::RedBlack is a perl implementation of the Red/Black tree algorithm found in the book "Algorithms", by Cormen, Leiserson & Rivest (more commonly known as "CLR" or "The White Book"). A Red/Black tree is a binary tree which remains "balanced"- that is, the longest length from root to a node is at most one more than the shortest such length. It is fairly efficient; no operation takes more than O(lg(n)) time. A Tree::RedBlack object supports the following methods: new(), root(), cmp(&), insert($, $), delete($), find($), node($), min() and max(). WWW: http://search.cpan.org/dist/Tree-RedBlack/
7 lines
290 B
Text
7 lines
290 B
Text
%%SITE_PERL%%/Tree/RedBlack.pm
|
|
%%SITE_PERL%%/Tree/RedBlack/Node.pm
|
|
%%SITE_PERL%%/%%PERL_ARCH%%/auto/Tree/RedBlack/.packlist
|
|
@dirrm %%SITE_PERL%%/%%PERL_ARCH%%/auto/Tree/RedBlack
|
|
@dirrmtry %%SITE_PERL%%/%%PERL_ARCH%%/auto/Tree
|
|
@dirrm %%SITE_PERL%%/Tree/RedBlack
|
|
@dirrmtry %%SITE_PERL%%/Tree
|