For th same data set order of a node of B+ tree is more(approx 50%) than that of B tree. So this leads to more number of keys values /child pointers can be packed in a each node of B+ tree.Hence the size of B+ tree will be less
time spent in input/output operations will be less in B+ tree.
hence B+ tree is preferred over B tree and binary search tree