Q5
What data structure is typically used for implementing a set with fast lookup and insertion operations?
A.
Binary Search Tree
B.
Queue
C.
Hash Set
AnswerD.
Stack
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board