[HN Gopher] Hash Based Trees and Tries
       ___________________________________________________________________
        
       Hash Based Trees and Tries
        
       Author : signa11
       Score  : 15 points
       Date   : 2023-10-11 04:20 UTC (11 hours ago)
        
 (HTM) web link (nrk.neocities.org)
 (TXT) w3m dump (nrk.neocities.org)
        
       | attractivechaos wrote:
       | A main advantage of trees is that keys are ordered. Data
       | structures in this post are not. In this case, an open addressing
       | hash table will be smaller and times faster. If rehashing is a
       | concern, a standard AVL or red-black tree is still the preferred
       | choice.
        
       ___________________________________________________________________
       (page generated 2023-10-11 16:02 UTC)