edited by
732 views
1 votes
1 votes

edited by

2 Answers

7 votes
7 votes

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

0 votes
0 votes
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.

Related questions

1 votes
1 votes
1 answer
1
Na462 asked Jun 29, 2018
608 views
Please Solve this question. I didn't understood the question properly so please Make Me as well :) What is meant by Leaf Page ?
1 votes
1 votes
2 answers
2
0 votes
0 votes
0 answers
3
bts1jimin asked Jan 9, 2019
375 views
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
2 votes
2 votes
2 answers
4
aditi19 asked Nov 23, 2018
1,603 views
what is the minimum and maximum number of keys for non-leaf nodes and leaf nodes for B+ Tree of order p?