A binary search tree keeps smaller keys on the left and larger keys on the right, so each comparison discards a whole subtree. A splay tree also moves every key it finds to the root, which makes repeated searches fast. A heap only orders parents above their children, so searching it may have to visit every node.