Please Solve the Answer Accordingly and do not copy from others make sure you provide reasoning with your answer. I will dislike if the answer is poor

Which is more efficient: from a QueueADT implemented with a circular array, or from a PriorityQueueADT implemented with a heap? dequeue() from queue removeBest() from priority queue Given this bounded generic class definition: which of the following standard Java types CANNOT be stored in an instance of this binary search tree? java.lang.Double java.lang.RuntimeException I am writing a program which will use a ListADT data structure. The most frequent operation that I plan to use is . Which underlying structure should I use to implement ListADT for the best runtime performance? oversize array doubly-linked list The operation begins at the last (largest-index) internal node of a heap. Which direction is this node percolated