Which data structure is most efficient for implementing a priority queue?

What is the average time complexity for searching an element in a hash table with a good hash function?

Which algorithm is best suited for finding the shortest path in a weighted graph without negative weights?

Is the worst-case time complexity of quicksort always O(n^2)?

Can a binary search tree contain duplicate keys and still maintain its BST properties?