// Peek return the highest priority entry
Peek return the highest priority entry
// Peek return the highest priority entry
func (pq *PriorityQueue) Peek() *Entry {
	if max, ok := pq.btree.Max().(*Entry); ok {
		return max
	}
	return nil
}
func ( pq * PriorityQueue ) Peek ( ) * Entry { if max , ok := pq . btree . Max ( ) . ( * Entry ) ; ok { return max } return nil }
Peek return the highest priority entry
Peek return the highest priority entry