in Databases edited by
2,054 views
1 vote
1 vote

The following key values are inserted into B+ tree in which the order of internal nodes is 4 and that of the leaf node is 5 in the sequence given below. The order of internal node is maximum number of keys in each node and the order of leaf node is the maximum number of pointers that can be stored in it. The B+ tree initially empty.

 2, 7, 3, 11, 17, 5, 19, 31, 29, 23

The sum of key values which responsible of leaf node split up as a result of these insertion is ________. (Assume right baising)

Soln.

Please Verify my solution :- 

 

in Databases edited by
by
2.1k views

4 Comments

See here

how keys are inserted in the tree

When we splitting node and copying the root node to child

At that time, if copying is done in left subtree, is called left biasing and if copying is done in right subtree it is called right biasing

got it?

0
0
0
0
I'm getting answer as 5+29=34

Can someone please verify!

First split will be at 5 and root as 7 and second split at 29 and 17 will move to root.

Correct if wrong!
1
1

1 Answer

0 votes
0 votes

Related questions