707 views
1 votes
1 votes

Order P=5 ( Max Child pointer )

If Keys are inserted in the sequence of 1,2,3,4,5...................Then which is the 1st key insertion that leads to level 4 

(i) B Tree

(ii) Left Biased B+ Tree

(iii) Right Biased B+ Tree

1 Answer

2 votes
2 votes

@debashish deka.... I solved by drawing and observing pattern in b tree

Related questions

0 votes
0 votes
1 answer
1
gauravkumawat asked Jun 13, 2023
882 views
please solve in paper formet Explain the properties of B-Tree Also Construct B+ tree with order P=410,5,30,40,20,17,90,45,93,60,20,50,29
0 votes
0 votes
0 answers
2
0 votes
0 votes
1 answer
3
Crackcer asked Jan 10, 2022
235 views
1. Suppose there is a B-tree, such that internal node with order 86 and leaf node with order 103.2. A B+ tree with internal order is 171 and leaf node with order 103.In b...
2 votes
2 votes
2 answers
4