P5-tree-redblack

Jul 20, 2023

Perl implementation of Red/Black tree, a type of balanced tree

TreeRedBlack 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 Olgn time.

A TreeRedBlack object supports the following methods new, root, cmp&, insert$, $, delete$, find$, node$, min and max.



Checkout these related ports:
  • Zziplib - Library to provide transparent read access to zipped files
  • Zydis - Fast and lightweight x86/x86-64 disassembler library
  • Zycore-c - Support library with platform independent types, macros, etc for Zydis
  • Zthread - Platform-independent object-oriented C++ threading library
  • Zookeeper - Coordination Service for Distributed Applications
  • Zls - Zig LSP implementation + Zig Language Server
  • Zfp - High throughput library for compressed floating-point arrays
  • Zeal - Offline documentation browser
  • Zapcc - C++ caching compiler based on clang
  • Zanata-platform - Web-based translation platform
  • Zanata-cli - Zanata Java command line client
  • Z88dk - Complete Z80/Z180 development kit
  • Z80ex - ZiLOG Z80 CPU emulator library
  • Z80asm - Assembler for the Z80 microprocessor
  • Z80-asm - Z80 assembly code assembler and disassembler