linked list heap sorted array unsorted array
insertion O(N) O(log N) O(N) O(1)
deletion O(N) O(log N) O(N) O(N)
searching O(N) O(N) O(log N) O(N)
judging by this, I have two main contenders heap and unsorted array. If more insertions than deletion then i will pick unsorted array but in general heap should be the answer so option B