Well, lets say you dont want to use a global variable, suppose your binary tree is composed of hash elements with "left" and "right" keys (where left<=mid<right) you might try something like this:
sub find_key_dupes {
my $binary_tree=shift;
my $key=shift;
my $sub;
my @dupes;
$sub=sub {
my $node=shift;
return unless $node;
if ($node->{key} lt $key) {
$sub->($node->{right});
} else {
push @dupes,$node if $node->{key} eq $key;
$sub->($node->{left});
}
};
$sub->($binary_tree);
return \@dupes;
}
This is using closures to simulate the effect of a Pascal's nested subroutines. Its a nice trick for having lexically scoped vars acting as globals to a recursive subroutine. This avoids having to pass them as parameters. Also, my guess is that you could avoid recursion entirely and do this with one sub (without nesting) using iterative techniques, which would be faster but probably slightly more complicated code.
Oh and I whipped that code out pretty fast, so its untested but you get the idea I hope. (And I hope its correct ;-)
Yves / DeMerphq
---
Writing a good benchmark isnt as easy as it might look.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|