Skip to content
/ Tree Public

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

Notifications You must be signed in to change notification settings

tbrowder/Tree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 

Repository files navigation

Tree

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

Synopsis

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
...

Implementation status

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

References

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

Copyright

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

LICENSE

Artistic-2.0

About

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

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published