File Coverage

blib/lib/Tree/Binary/Visitor/PostOrderTraversal.pm

Criterion	Covered	Total	%
statement	27	27	100.0
branch	8	8	100.0
condition	3	3	100.0
subroutine	8	8	100.0
pod	1	1	100.0
total	47	47	100.0

package Tree::Binary::Visitor::PostOrderTraversal;

use strict;
use warnings;

use Scalar::Util qw(blessed);

use Tree::Binary::Visitor::Base;

our $VERSION = '1.09';

our @ISA = qw(Tree::Binary::Visitor::Base);

# visit routine
sub visit {
	my ($self, $tree) = @_;
	(blessed($tree) && $tree->isa("Tree::Binary"))
		|| die "Insufficient Arguments : You must supply a valid Tree::Binary object";
    # get all things set up
    my @results;
	my $func;
    if ($self->{_filter_function}) {
        $func = sub { push @results => $self->{_filter_function}->(@_) };
    }
    else {
        $func = sub { push @results => $_[0]->getNodeValue() };
    }
	# apply the function recursively to all its children

    my $_postOrderTraverse = sub {
        my ($tree, $func, $traversal_function) = @_;
        $traversal_function->($tree->getLeft(), $func, $traversal_function) if $tree->hasLeft();
        $traversal_function->($tree->getRight(), $func, $traversal_function) if $tree->hasRight();
        $func->($tree);
    };
    $_postOrderTraverse->($tree, $func, $_postOrderTraverse);

    # now store the results we got
    $self->setResults(@results);
}

1;

__END__