Which data structures are used by a radix sort? A. stacks B. A., B., and C. are all correct C. both A. and B. are correct D. heaps E. queues

The heap data structure is the most efficient way of implementing the ..................a)Priority queueb)None of the mentionedc)Front queued)Back queue

Heap can be used as :a) Priority queueb) Stackc) A decreasing order arrayd) None of the mentioned

Which of following data structure is more appropriate for implementing quick sort iteratively?a.Dequeb.Queuec.Stackd.Priority queue

In a radix sort, the radix is the number of elements to be sorted. A. True B. False

Which implementation technique is commonly used for Priority Queues?a)Heapsb)Arraysc)Linked Listsd)Stacks