HashSet is usually faster for add/contains (average O(1)) because it’s hash-based. TreeSet keeps elements sorted (balanced tree), so operations are O(log n) but you get ordering and range queries.