Often there is not a big difference in the performance of a B$-$Tree compared to a B$+-$Trees when it comes to searching for a particular record in the index. Why then do practitioners more often choose to use a B$+-$Tree? Short answer.