How to Install and Uninstall libtree-redblack-perl Package on Kali Linux

Last updated: May 02,2024

1. Install "libtree-redblack-perl" package

This is a short guide on how to install libtree-redblack-perl on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libtree-redblack-perl
            
                    
    
    Copied

2. Uninstall "libtree-redblack-perl" package

This is a short guide on how to uninstall libtree-redblack-perl on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libtree-redblack-perl
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libtree-redblack-perl package on Kali Linux

Package: libtree-redblack-perl
Version: 0.5-4
Installed-Size: 40
Maintainer: Debian Perl Group
Architecture: all
Depends: perl:any
Size: 12564
SHA256: ff8ddce426f9a7bf92f2c4054ec2f81a2c8757cbaa9849f269a073f7756cde5c
SHA1: 9841b77dc4a07f6fa710a1d350630464cd3e256b
MD5sum: 40c3e384a6a0b02200d4eb865e9ad85c
Description: Perl implementation of Red/Black tree, a balanced tree
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.
Description-md5:
Multi-Arch: foreign
Homepage: https://metacpan.org/release/Tree-RedBlack
Tag: devel::lang:perl, devel::library, implemented-in::perl, role::devel-lib
Section: perl
Priority: optional
Filename: pool/main/libt/libtree-redblack-perl/libtree-redblack-perl_0.5-4_all.deb