M

Mr. Dubey • 53.50K Points
Coach 

Q. A self – balancing binary search tree can be used to implement

(A) Priority queue
(B) Hash table
(C) Heap sort
(D) Priority queue and Heap sort
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Stack words on:

Q. Which of the following is an object-oriented feature?

Q. Agreement between communication devices are called

Q. If a relationship has a cascade updates constraint, then if ________ in the parent table is changed, then the same change will automatically be made t

Q. Suppose, you got a situation where you find that your linear regression model is under fitting the data. In such situation which of the following opti

Q. Set A has 3 elements, set B has 6 elements, then the minimum number of elements in A U B is ….

Q. Which of the following data structure is non-linear type?

Q. Firewalls are to protect against________.

Q. Quicksort's performance is greatly affected by the way it partitions a sequence.

Q. Managed code .......

Question analytics