How to Install and Uninstall libtree-redblack-perl Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: December 23,2024

1. Install "libtree-redblack-perl" package

This tutorial shows how to install libtree-redblack-perl on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libtree-redblack-perl
            
                    
    
    Copied

2. Uninstall "libtree-redblack-perl" package

Please follow the step by step instructions below to uninstall libtree-redblack-perl on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libtree-redblack-perl
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libtree-redblack-perl package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: libtree-redblack-perl
Priority: optional
Section: universe/perl
Installed-Size: 88
Maintainer: Ubuntu MOTU Developers
Original-Maintainer: Debian Perl Group
Architecture: all
Version: 0.5-1
Depends: perl (>= 5.6.0-16)
Filename: pool/universe/libt/libtree-redblack-perl/libtree-redblack-perl_0.5-1_all.deb
Size: 14664
MD5sum: 20d674d4b7bf8fbcb790d44a126462ae
SHA1: 495c69776be07c383c3004cda1cd6c8d092e7215
SHA256: f779193da0e90f71c8e2fce3408c2fd42668ec6c1e728b261738fa1e1dd587ee
Description-en: Perl implementation of Red/Black tree, a balanced tree
This 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.
Description-md5: 756f4973ce70c6773d9ad734b08ef7dc
Homepage: http://search.cpan.org/dist/Tree-RedBlack/
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu