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)