// get and remove the element with maximum score, nil if the set is empty
//
// Time complexity of this method is : O(log(N))
get and remove the element with maximum score, nil if the set is empty

Time complexity of this method is : O(log(N))
// get and remove the element with maximum score nil if the set is empty // // Time complexity of this method is : O ( log ( N ))
func (this *SortedSet) PopMax() *SortedSetNodeKV {
	x := this.tail
	if x != nil {
		return this.Remove(x.key)
	}
	return nil
}
func ( this * SortedSet ) PopMax ( ) * SortedSetNodeKV { x := this . tail if x != nil { return this . Remove ( x . key ) } return nil }
get and remove the element with maximum score, nil if the set is empty
get and remove the element with maximum score nil if the set is empty