How does a SortedSet<T> differ from a HashSet<T>?

Short answer: Feature SortedSet<T> HashSet<T> Ordering Maintains sorted order No guaranteed order Implementation Balanced binary search tree Hash table Lookup complexity O(log n) O(1) average Memory overhead Higher (tree nodes) Lower (hash buckets) Use case When sorted data or range queries needed Fast insertion and lookup without ordering

Say this in the interview

1. Define — one clear sentence (the short answer above).
2. Example — relate it to a project like ShopNest or your real work.
3. Trade-off — when you would not use it.