Struct MinHeap

pub struct MinHeap<T: Ord>(pub Vec<T>);

A very simple min heap implementation

Tuple Fields

0: Vec<T>

Trait Implementations

impl<T: Ord> Heap<T> for MinHeap<T>

fn len(&self) -> usize

length must return the length of the heap

fn less(&self, i: usize, j: usize) -> bool

Compares two elements of the heap at i and j index It is guaranteed that the i and j are always valid

fn swap(&mut self, i: usize, j: usize)

This function must swap the i and j element in the heap array It is guaranteed that the i and j are always valid

fn push(&mut self, x: T)

push is just like push in vector. It should add x to the last of array

fn pop(&mut self) -> T

This method should remove the last element of array and return it This function is guaranteed to be called when at least one element in available

fn peak(&self) -> Option<&T>

This method must return first element in your collection