Returns true if this set contains the specified element.
Returns true if this set contains the specified element.For tree sets this method has a time complexity of O(Log N), with N being the size of the set.
For hash sets this method has a complexity of O(1).