libtree-redblack-perl
Perl implementation of Red/Black tree, a balanced tree
Description
Tree::RedBlack is a demonstration package, showing the performance differences between different methods of data storage and accessing. It contains 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. An example perl script is contained in the documentation directory, which would show the different run times using hash table, linear or tree structure.Upload more screenshots
Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.
Upload a screenshotHint: upload an image here from your clipboard with Ctrl-V
Homepage
https://metacpan.org/release/Tree-RedBlack
Install this software package
If the package is available for the distribution you are currently using on your computer then install the software by clicking on…
Install libtree-redblack-perl