 Binary search trees lend themselves to fast searching in external memory stored in hard disks, as binary search trees can be efficiently structured in filesystems.The B-tree generalizes this method of tree organization.B-trees are frequently used to organize long-term storage such as databases and filesystems.