CODEWITHSUNDEEP
data-structurestree
d9h
d9h

Reputation: 89

How to insert in a B* tree

I have a B* tree of degree m=3 with 7 in the root and 1,2,3,4,5,6 in the left child and 8,9,10,11,12,13 in the right. Now I want to insert 14. What do I do? The 14 will cause an overflow in the right child. How do I resolve this? Do I only split the right child, and move 11 up to the root or do I have to do something with the left child too?

Upvotes: 1

Views: 58

Answers (1)

Jon
Jon

Reputation: 150

If you know the order in which you inserted the nodes, you can use this website to recreate your tree and simulate what will happen when you insert 14 and it'll animate it for you. It's a nice visual representation of how B-trees work. https://www.cs.usfca.edu/~galles/visualization/BTree.html

Upvotes: 2

Related Questions