retagged by
1,009 views
1 votes
1 votes
Searching and retrieval of data is more efficient using which tree?

B Tree or B+ Tree?
retagged by

2 Answers

1 votes
1 votes
I think it is B+ trees because the time complexity for searching in case of both b trees and b+ trees depends on the height of the tree. Since b+ trees usually store more no. of keys as compared to b trees in the same level, height of b+ trees are always less than b trees for similar conditions. B+ trees also have connected leaves which also helps in executing range query faster.

CORRECT ME IF I AM WRONG

Related questions

0 votes
0 votes
1 answer
1
Markzuck asked Dec 18, 2018
466 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?
0 votes
0 votes
1 answer
3