B-tree deletion

If the minimum degree of a B-tree is 50, what is the minimum number of keys and maximum number of children for each node?

• 49,100

• 50,100

• 50,50

• 50,100

If a key k in an internal node x has to be deleted and x has a left subtree of t-1 keys and right subtree of t keys, the inorder successor from the right subtree is brought to x and the key k is deleted

• True

• False

Given a b tree of minimum degree 3. If the key 85 has to be deleted, what is the case performed first.

• Deletion of 85 in the leaf

• Merging of 45,70 and 85,92 node

• Merging of 10,40,80 and 25,400 nodes

When a key in internal node has to be deleted how many possibilities of subcases have to be considered?

• 1

• 2

• 3

• 4

Write your comments on how clear the concept has been delivered in this video