BinaryHeap example should show how to make a min-heap.

[forrestthewoods]

std::collections::BinaryHeap is a max-heap. A very common use case for users will be to make a min-heap. The basic example should include a min-heap.

[hellow554]

Do you think you would be able to make a PR based on e.g. https://stackoverflow.com/questions/54489368/how-do-i-create-a-binaryheap-that-pops-the-smallest-value-not-the-largest ?

[rasendubi]

Added an example in #60451

[HernandoR]

I would like to point out that the current tutorial of making min-heap introduces unnecessary Some(Reverse(v))) to the heap.

Is there any alternative I could approach to? or is it possible to introduce a compare function to binary heap?

[hellow554]

I would like to point out that the current tutorial of making min-heap introduces unnecessary Some(Reverse(v))) to the heap.

Not sure what you mean by unnecessary here. Can you explain?

Is there any alternative I could approach to? or is it possible to introduce a compare function to binary heap?

Using a newtype is the way to use a custom compare function. By using Reverse you simply reverse the original compare function which is most often easier than completely rewriting your own.