Ace Test Series: Databases - B Tree

Question

Comments

I had studied that if any non leaf node is to be deleted then it is replaced by its in-order successor but here the answer is c

---

Isnt this correct when 10 is removed 6|15 combined which intyrn their leaf node also combine but will result like this

7|8|12 --> So this should break . 8 goes above 6|15 which becomes  ---> 6|8|15

which again will break so 8 goes above as root .

So , Ans C

---

only option D is correct, it is as same as deletion of keys in the binary search tree. The deleted key will be replaced by either inorder predecessor or inorder successor...

Answer 1

D)Both A and C

One of the property of B-Trees is for every node its left subtrees values should be less than that and right subtree values should be greater than that

So if the Root node is deleted we now have 2 option :

Replace the root with greatest value of left subtree or least value of right subtree

Both A and C are Satisfies which still manages the property of B-tree so D is correct

Answer 2

option c,because 12 is single in right side node.but in left side node,two elements in single node i.e 7 and 8.so 8 wil be root.