Data Structures | Linked List | Question 10

Last Updated :
Discuss
Comments

Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be the slowest? (GATE CS 2004)

union 

 membership

cardinality

 union, intersection

This question is part of this quiz :

Top MCQs on Linked List Data Structure with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy