edited by
541 views
1 votes
1 votes

Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node.

(A) B tree index has more levels than B+ tree index for large number of keys.

(B) B+ tree index has more levels than B tree index for large number of keys.

(C) Both B tree B+ tree best for sequential access of records.

(D) B tree index nodes more than B+ tree for large number of keys.

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
3 answers
2
Na462 asked Feb 2, 2019
2,038 views
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?
0 votes
0 votes
1 answer
4
Markzuck asked Dec 18, 2018
465 views
By default take ROOT at level 1 or 0?and if asked for B tree then take all the levels but for B+ records only at leaf so only leaf level keys right?