Insert, delete, search

Which data structure provides O(1) average case for insert, delete, and search operations?

A

Hash Table

B

Binary Search Tree

C

Sorted Array

D

Linked List