a question about running time:Which of the following is not true about binary heap? A. It supports insert() in O(LogN) worst-case time; B. It supports insert() in O(1) best-case time; C. It supports findMin() in O(logN) average time; D. It supports deleteMin() in O(logN) worst-case time; I think A and B should be right. But not sure about C and D. Thanks a lot!!!

But I think it can-->For example, for an array based min heap, inserting a value larger than the maximum of original heap will tabke O(1) time if bottom-up algorithm is applyied Correct me if i am wrong