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