Removes and returns the last element of this set.
Removes and returns the last element of this set.For hash sets removing an element at the end of the set has a time complexity of O(N), with N being the capacity of the set.
For tree sets removing an element at the end of the set has a time complexity of O(Log N), with N being the number of elements in the set.