3 ms·
I've seen most real-world applications that use in-memory search, use balanced binary search trees. Are any of these improvements applicable to those data struc
by diehunde 6y ago
I've seen most real-world applications that use in-memory search, use balanced binary search trees. Are any of these improvements applicable to those data structures? AVL and Red-black trees come to mind.
- adrianN 6y agoAVL and Red-black trees are pretty terrible and can easily be improved upon by cache-friendlier data structures like for example B-trees.