About this question
Medium · Algorithms & Data Structures · Quant Trader interview question · data-structures, algorithms, trees, database, cache-locality
Database systems often use tree-based data structures for indexing. While both red-black trees and B-trees are balanced search trees, B-trees are generally preferred for implementing database indices. Why is this the case?