Struct BinaryHeap 

pub struct BinaryHeap<T: Ord> { /* private fields */ }

A binary min-heap backed by a Vec.

The smallest element is always at the root (index 0). All operations maintain the heap property: parent ≤ children.

Implementations

impl<T: Ord> BinaryHeap<T>

pub fn new() -> Self

Create a new empty min-heap.

pub fn len(&self) -> usize

Return the number of elements in the heap.

pub fn is_empty(&self) -> bool

Return true if the heap contains no elements.

pub fn push(&mut self, item: T)

Push an element onto the heap, restoring the heap property.

Time complexity: O(log n).

pub fn pop(&mut self) -> Option<T>

Remove and return the minimum element, or None if the heap is empty.

Time complexity: O(log n).

pub fn peek(&self) -> Option<&T>

Return a reference to the minimum element, or None if the heap is empty.

Time complexity: O(1).

Trait Implementations

impl<T: Ord> Default for BinaryHeap<T>

fn default() -> Self

Returns the “default value” for a type.