Search code examples
algorithmdata-structuresb-tree

How do you remove an element from a b-tree?


I'm trying to learn about b-tree and every source I can find seem to omits the discussion about how to remove an element from the tree while preserving the b-tree properties.

Can someone explain the algorithm or point me to resource that do explain how it's done?


Solution

  • There's an explanation of it on the Wikipedia page. B-tree - Deletion