Fix doc typo for PopMax()

btree.go

@@ -168,7 +168,7 @@ func (tr *BTree) PopMin() any {
 	return v
 }
 
-// PopMax removes the minimum item in tree and returns it.
+// PopMax removes the maximum item in tree and returns it.
 // Returns nil if the tree has no items.
 func (tr *BTree) PopMax() any {
 	v, ok := tr.base.PopMax()

generic.go

@@ -457,7 +457,6 @@ func (tr *Generic[T]) delete(cn **node[T], max bool, key T,
 		tr.nodeRebalance(n, i)
 	}
 	return prev, true
-
 }
 
 // nodeRebalance rebalances the child nodes following a delete operation.
@@ -769,7 +768,7 @@ func (tr *Generic[T]) PopMin() (T, bool) {
 	return tr.deleteHint(item, nil)
 }
 
-// PopMax removes the minimum item in tree and returns it.
+// PopMax removes the maximum item in tree and returns it.
 // Returns nil if the tree has no items.
 func (tr *Generic[T]) PopMax() (T, bool) {
 	if tr.lock() {

map.go

@@ -325,7 +325,6 @@ func (tr *Map[K, V]) delete(pn **mapNode[K, V], max bool, key K,
 		tr.nodeRebalance(n, i)
 	}
 	return prev, true
-
 }
 
 // nodeRebalance rebalances the child nodes following a delete operation.
@@ -623,7 +622,7 @@ func (tr *Map[K, V]) PopMin() (K, V, bool) {
 	return tr.empty.key, tr.empty.value, false
 }
 
-// PopMax removes the minimum item in tree and returns it.
+// PopMax removes the maximum item in tree and returns it.
 // Returns nil if the tree has no items.
 func (tr *Map[K, V]) PopMax() (K, V, bool) {
 	if tr.root == nil {

set.go

@@ -86,15 +86,13 @@ func (tr *Set[K]) Max() (K, bool) {
 func (tr *Set[K]) PopMin() (K, bool) {
 	key, _, ok := tr.base.PopMin()
 	return key, ok
-
 }
 
-// PopMax removes the minimum item in tree and returns it.
+// PopMax removes the maximum item in tree and returns it.
 // Returns nil if the tree has no items.
 func (tr *Set[K]) PopMax() (K, bool) {
 	key, _, ok := tr.base.PopMax()
 	return key, ok
-
 }
 
 // GetAt returns the value at index.