A hash map storing key-value pairs provides average-case constant time for which operation?

A hash table with a good hash function provides what average-case time complexity for insertion?

Collisions in a hash table can be resolved using:

The load factor of a hash table is defined as the ratio of:

A hash function should ideally distribute keys:

A hash table using open addressing with linear probing resolves a collision by:

Which traversal of a binary search tree visits nodes in ascending sorted order?