1

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

Correct Answer: Priority queue

Make the most of this question

This page focuses on one Data Structure (DS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Data Structure (DS) MCQ: A self – balancing binary search tree can be used to implement | Extra Education