My professor was giving a lecture on B+ Trees deletion, and I got very confused. According to him for deleting any key from a B+ Tree:
1- First navigate to the leaf *L* where it belongs. 2- If the *L* is at least half full if you can simply delete it. 3- If it contains d-1 elements then you need to redistribute and merge.
If you see the below image, here I want to delete 19 and 20 from the B+ Tree.
After deleting 19 and 20 from the B+ Tree.
I am confused why the redistribution and merging is required here at all? If you just simply delete 19 and 20 from the leaf nodes without any distribution it should work right? Why redistribution is performed here? Could anyone explain?
Is it because the left pointer of 24 is pointing to 20 but no 19. Thats why redistribution is required for 20 but not 19.