Binary search trees lend themselves to fast searching in external memory stored in hard disks , as binary search trees can effectively be structured in filesystems .
Binary search trees lend themselves to fast searching in binary memory stored in hard disks , as external search trees can effectively be structured in filesystems .