#! perl
use strict;
use warnings;
use Tree::Binary::Search;
use Tree::Binary::Visitor::InOrderTraversal;

for (1 .. 20)
{
    my $btree = Tree::Binary::Search->new;
       $btree->useNumericComparison;

    for (1 .. 10)
    {
        my $num = int rand 100;
        redo if $btree->exists($num);
        $btree->insert($num => 1);
    }

    my $visitor = Tree::Binary::Visitor::InOrderTraversal->new;
       $visitor->setNodeFilter(sub { $_[0]->getNodeKey });

    $btree->accept($visitor);
    print join(' ', map { sprintf '%2d', $_ } $visitor->getResults), "\n";
    $btree->DESTROY;
}