Siksha Sarovar

Siksha Sarovar (sikshasarovar.com) is a free educational web application that helps students in India learn programming and prepare for academic and competitive exams. The platform offers structured coding courses (C, C++, Python, Java, HTML, CSS, PHP, Power BI, AI, Machine Learning, Data Science), complete university curriculum notes for BCA/MCA students with previous year question papers, Class 10 and Class 12 CBSE/HBSE school notes, and dedicated preparation material for SSC, UPSC, Banking, Railway and other government exams. Browsing the site is completely free and requires no account. Users may optionally sign in with Google solely to save their learning progress, quiz scores and personal preferences across devices.

Privacy Policy | Terms of Service | Contact Siksha Sarovar | About Siksha Sarovar

v4.0.9 · PWA
Siksha Sarovar logo
Siksha Sarovar
Your Learning Universe

Siksha Sarovar is a free e-learning platform for coding courses, BCA university notes and competitive exam preparation. Optional Google sign-in saves your learning progress across devices.

Initializing knowledge base…
Compiling modules 0%

Set Interface

Lesson 32 of 39 in the free Java notes on Siksha Sarovar, written by Rohit Jangra.

Set Interface

Set is a child interface of Collection that does NOT allow duplicates. Key Features:

  1. Uniqueness: Only unique elements are stored.
  2. Insertion Order: Not guaranteed (Depends on implementation).
  3. Null Values: Allowed (only one null).

Implementation Classes

  1. HashSet
  2. LinkedHashSet
  3. TreeSet

1. HashSet

Backend: Uses HashMap internally. • Order: No guarantee (Random order). • Performance: Fast (Hashing mechanism). • Null: Allows one null. • Mechanism: Uses hashCode() and equals() to check duplicates.

2. LinkedHashSet

Backend: Linked List + Hash Table. • Order: Preserves Insertion Order. • Performance: Slightly slower than HashSet. • Use Case: To remove duplicates while keeping order.

3. TreeSet

Backend: TreeMap (Red-Black Tree). • Order: Sorted Order (Ascending by default). • Null: DOES NOT allow null (throws NullPointerException). • Complexity: O(log n).

Comparison

ClassOrderDuplicatesSortingnull
HashSetRandomNoNoYes
LinkedSetInsertionNoNoYes
TreeSetSortedNoAscendingNo