| Name : perl-Tree-RedBlack
| |
| Version : 0.3
| Vendor : PLD
|
| Release : 8
| Date : 2002-08-17 09:56:21
|
| Group : Development/Languages/perl
| Source RPM : perl-Tree-RedBlack-0.3-8.src.rpm
|
| Size : 0.02 MB
| |
| Packager : PLD bug tracking system ( http://bugs_pld_org_pl/ )
| |
| Summary : Tree::RedBlack - Perl implementation of Red/Black tree, a type of balanced tree
|
Description :
This 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.
|
RPM found in directory: /vol/rzm3/linux-pld/dists/ra/PLD/i386/PLD/RPMS |
