Register

B+ tree

• retagged by
566 views
0 votes
0 votes

Consider the B+ tree shown in Figure

image

What is the minimum number of insertions of data entries with distinct keys that will cause the height of the original tree to change from its current value (of 1) to 3?

please explain??

• 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

2 votes
2 votes
1 answer
1
S Ram asked Feb 6, 2017
501 views
the gate book mock test 1
how exactly to solve this??
how exactly to solve this??
User Avatar
0 votes
0 votes
0 answers
2
Sahil_Lather asked Jan 29, 2023
511 views
TestBook TestSeries question to find max child possible in B+ Tree
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes which can be used to store all the keys? A. 17 B. 19 C. 59 D. 57
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes whic...
User Avatar
0 votes
0 votes
3 answers
3
Na462 asked Feb 2, 2019
2,096 views
B+ Tree Records
User Avatar
0 votes
0 votes
0 answers
4
bts1jimin asked Jan 9, 2019
386 views
B+ tree
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
User Avatar
Link Copied!