Retrieves and removes the tail (last element) of this set.
Retrieves and removes the tail (last element) of this set.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 time complexity of O(N), with N being the capacity of the set.