if a binary tree had more than 2 children
b-tree beats binary tree in memory locality — you can store and access it more efficiently on disk
used in databases
1 min read
if a binary tree had more than 2 children
b-tree beats binary tree in memory locality — you can store and access it more efficiently on disk
used in databases