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/
2 lines
140 B
Text
2 lines
140 B
Text
SHA256 (Tree-RedBlack-0.5.tar.gz) = 406c06d21a5d38314b05e25516ee5942ebecd8a5c40b43a23ed4170fab3b657a
|
|
SIZE (Tree-RedBlack-0.5.tar.gz) = 5734
|