Raku implementation of variants of the Binary Tree, e.g., BST, AVL, Red-Black, and M-Ary

use Tree::AVL; # default: unique keys, i.e., a set

my $tree = Tree::AVL.new;
$tree.insert: 1, :data<some text>;
# check for success
say $tree.result; # output: True
$tree.insert: 1;
say $tree.result; # output: False
...

1. BST - Work in progress (WIP)
2. AVL - WIP
3. Red-Black - Planned
4. M-Ary - Planned

1. Introduction to Algorithms, Third Edition; by ...

Copyright (c) 2009, Thomas Browder tom.browder@gmail.com

Artistic-2.0