From the old days I remember the term red black tree for such search operations and a look up on CPAN says there are modules for it. Not sure whether this suits your requiement.
In reply to Re: Heap structure for lookup?
by hdb
in thread Heap structure for lookup?
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |