Let’s Invent B(+)-Trees
Let’s invent B(+)-trees.Say we have some things, and we want to be able to store and look them up in order. We could just put them in a big sorted array: 10,20,30,40,50,60,70 This is great, but it’s hard to mutate — to insert or delete an element, we might have to move all the others!So,…
Read More