// Tail return the lowest priority entry
Tail return the lowest priority entry
// Tail return the lowest priority entry
func (pq *PriorityQueue) Tail() *Entry {
	if min, ok := pq.btree.Min().(*Entry); ok {
		return min
	}
	return nil
}
func ( pq * PriorityQueue ) Tail ( ) * Entry { if min , ok := pq . btree . Min ( ) . ( * Entry ) ; ok { return min } return nil }
Tail return the lowest priority entry
Tail return the lowest priority entry