Retrieves, but does not remove, the head (first element) of this set.
Retrieves, but does not remove, the head (first element) of this set.Retrieving the first element of a hash set has a time complexity of O(N), with N being the capacity of the set.
Retrieving the first element of a tree set has a time complexity of O(Log N), with N being the size of the set.