Choosing a Data Structure: BST vs Hash vs Heap

Match each required operation to the cheapest structure that supports it; when an ADT mixes order queries with lookup-by-identity, combine a balanced BST (or heap) with a hash index instead of forcing one structure to do everything.