Q71
Which data structure is used for efficiently finding the k-th smallest or largest element in an unsorted array?
A.
Heap
AnswerB.
Quickselect
C.
Trie
D.
Segment Tree
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board