in reply to Binary tree without recurssion

Tree::Binary2 is simple enough, and does not require recursion to populate it.

A search can be a simple grep: 

my @found_nodes= grep { $_->value =~ /LookForThis/  } $tree->traverse(
+ $tree->POST_ORDER );

[download]

        "I can cast out either one of your demons, but not both of them." -- the XORcist

In Section Seekers of Perl Wisdom