actually LanX didn't realize that it's only meant for binary trees! =)
So your solution shouldn't be more expensive than e.g. hdbs.
(Perl's arrays are almost as efficient as linked lists, shift and unshift often just change internal pointers w/o expensive allocations)
Cheers Rolf
( addicted to the Perl Programming Language)
In reply to Re^4: Challenge: Perl 5: lazy sameFinge()?
by LanX
in thread Challenge: Perl 5: lazy sameFringe()?
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |