2 ms·
Not especially cache efficient compared to trees with higher branching factor, true. But intrusive data structures can be manipulated without memory allocation
by loeg 6y ago
Not especially cache efficient compared to trees with higher branching factor, true. But intrusive data structures can be manipulated without memory allocation, such as when holding locks. That is the main reason they are useful in place of B-trees.