Just another Perl shrine | |
PerlMonks |
Re^3: Heap structure for lookup?by RichardK (Parson) |
on May 27, 2015 at 10:26 UTC ( [id://1127972]=note: print w/replies, xml ) | Need Help?? |
As you're only storing single values it shouldn't be too bad, only the balancing code gets a bit involved, when you split the current node you insert into it's parent node which may cause it to split and so on back up to the root node. It's really not that hard, once you get your head round it. Anyway you've had 20 more years of experience since then, so you shouldn't have any problems ;)
In Section
Seekers of Perl Wisdom
|
|