rust 优先队列BinaryHeap

Rust提供的优先队列是基于二叉最大堆实现的

fn testBinaryHeap(){
    use std::collections::BinaryHeap;
    let mut heap = BinaryHeap::new();
    let arr = [93,80,48,53,72,30,18,36,15,35,45];
    for &i in arr.iter(){
        heap.push(i);
    }
    assert_eq!(heap.peek(),Some(&93));
    println!("{:?}",heap);
}

[93, 80, 48, 53, 72, 30, 18, 36, 15, 35, 45]