The correct answer is that TreeSet requires elements to be mutually comparable unless a Comparator is provided, while HashSet relies on equals() and hashCode() for uniqueness. This distinction is fundamental because HashSet determines element identity through hash-based equality checks, whereas TreeSet enforces uniqueness via the compareTo() method or a supplied Comparator, meaning two objects that are equal according to equals() but not compareTo() could coexist in a TreeSet only if no Comparator is used. On the Oracle Certified Professional Java SE 17 Developer 1Z0-829 exam, this concept tests your understanding of how different Set implementations handle ordering and duplicate detection, often appearing in questions that ask you to identify which statements about behavior are true. A common trap is assuming TreeSet uses equals() for uniqueness—it does not, which can lead to unexpected results if elements lack natural ordering. Remember the mnemonic: “Hash for hash, Tree for order—equals for one, compare for the other.”
1Z0-829 Working with Arrays and Collections Practice Question
This 1Z0-829 practice question tests your understanding of working with arrays and collections. Read the scenario carefully and evaluate each option against the stated constraints before committing to an answer. After answering, compare your reasoning against the explanation and wrong-answer breakdown below. Once you have made your selection, read the full explanation to reinforce the concept and understand why each distractor is designed to mislead on exam day.
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
HashSet uses equals() and hashCode() for uniqueness, TreeSet uses compareTo() or Comparator.
Option B is correct because HashSet relies on the equals() and hashCode() methods to determine element uniqueness, while TreeSet uses the natural ordering (compareTo()) or a provided Comparator to maintain sorted order and check for duplicates. This distinction is fundamental to how these Set implementations enforce uniqueness.
Key principle: Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
✗
HashSet maintains elements in insertion order.
Why it's wrong here
LinkedHashSet does.
✓
HashSet uses equals() and hashCode() for uniqueness, TreeSet uses compareTo() or Comparator.
Why this is correct
Correct.
Related concept
Read the scenario before looking for a memorised answer.
✗
Both implement the List interface.
Why it's wrong here
They implement Set.
✗
Both guarantee constant-time performance for basic operations (add, remove, contains).
Why it's wrong here
TreeSet is O(log n).
✓
TreeSet requires elements to be mutually comparable, unless a Comparator is provided.
Why this is correct
Otherwise ClassCastException.
Related concept
Read the scenario before looking for a memorised answer.
Common exam traps
Common exam trap: answer the scenario, not the keyword
The trap here is that candidates often confuse the performance guarantees of HashSet (constant-time average) with TreeSet (logarithmic time), or mistakenly think both maintain insertion order, when in fact only LinkedHashSet does.
Detailed technical explanation
How to think about this question
HashSet internally uses a HashMap to store elements, where the element is the key and a constant dummy object is the value, relying on hashCode() to determine the bucket and equals() to check for duplicates. TreeSet is backed by a TreeMap (a Red-Black tree), which ensures elements are stored in sorted order and provides O(log n) time for add, remove, and contains operations. A subtle behavior: if a mutable object is used as a key in a TreeSet and its comparison attributes change after insertion, the set may violate its ordering contract and fail to locate or remove the element correctly.
KKey Concepts to Remember
Read the scenario before looking for a memorised answer.
Find the constraint that changes the correct option.
Eliminate answers that are true in general but not in this case.
TExam Day Tips
→Watch for words such as best, first, most likely and least administrative effort.
→Review why wrong options are wrong, not only why the correct option is correct.
Key takeaway
Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Real-world example
How this comes up in practice
A small business has 20 workstations on the 192.168.1.0/24 network and one public IP from its ISP. The router uses PAT (NAT overload) so all 20 devices share one public address using different source ports. NAT questions test whether you understand the four address terms and which direction each translation applies.
What to study next
Got this wrong? Here's your next step.
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
Working with Arrays and Collections — This question tests Working with Arrays and Collections — Read the scenario before looking for a memorised answer..
What is the correct answer to this question?
The correct answer is: HashSet uses equals() and hashCode() for uniqueness, TreeSet uses compareTo() or Comparator. — Option B is correct because HashSet relies on the equals() and hashCode() methods to determine element uniqueness, while TreeSet uses the natural ordering (compareTo()) or a provided Comparator to maintain sorted order and check for duplicates. This distinction is fundamental to how these Set implementations enforce uniqueness.
What should I do if I get this 1Z0-829 question wrong?
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
What is the key concept behind this question?
Read the scenario before looking for a memorised answer.
About these practice questions
Courseiva creates original exam-style practice questions with explanations and wrong-answer analysis. It does not publish real exam questions, exam dumps, or protected exam content. Learn why practice questions differ from exam dumps →
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
This 1Z0-829 practice question is part of Courseiva's free Oracle certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the 1Z0-829 exam.
Question Discussion
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
Sign in to join the discussion.