Function del_min

src/tree/binary/rb2.rs:220–236

delete the min element rooted at h

(h: Option<NonNull<Node<K, V>>>)

/// delete the min element rooted at h
fn del_min<K, V>(h: Option<NonNull<Node<K, V>>>) -> Option<NonNull<Node<K, V>>> {
    let mut h = NodeQuery::new(h);

    if h.left().is_none() {
        if let Some(h) = h.node.take() {
            Node::release(h);
        }
        None
    } else {
        if !h.left().is_red() && !h.left().left().is_red() {
            h.node = move_red_left(h.node);
        }
        let new_left = del_min(h.left().node);
        h.set_left(new_left);
        balance(h.node)
    }
}

/// delete the max element rooted at h
fn del_max<K, V>(h: Option<NonNull<Node<K, V>>>) -> Option<NonNull<Node<K, V>>> {