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

1. Priority queue

2. Hash table

3. Heap sort

4. Priority queue and Heap sort

  • a. Priority queue

Related Topics

Subscribe Now

Get All Updates & News