Register

B+ Tree insertion sequence

• retagged by
557 views
1 votes
1 votes

What should be the insertion order of elements such that the following B+ Tree is obtained? (order of root node = 3, and leaf node = 2)

• retagged by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
indrajeet asked Jan 18, 2017
989 views
B-tree Insertion
An order 3 B-tree is an index tree where every node other than root has at most 2 keys and at least one key. Starting with an empty tree if following keys are inserted into the tree 1,2,3,4,5,6,7,8,9,10. (not necessarily in the given order.) What would be the minimum number of node splits possible, if node splitting algorithm is used?
An order 3 B-tree is an index tree where every node other than root has at most 2 keys and at least one key. Starting with an empty tree if following keys are inserted in...
User Avatar
18 votes
18 votes
1 answer
2
Akanksha Kesarwani asked Dec 10, 2016
6,397 views
left biasing and right biasing in B+ tree insertion
Difference between left biasing and right biasing in B+ tree insertion, Rules to be followed for left and right biasing , Kindly explain with an example ?
Difference between left biasing and right biasing in B+ tree insertion, Rules to be followed for left and right biasing , Kindly explain with an example ?
User Avatar
Link Copied!