Function do_build

src/tree/binary/builder/tournament.rs:95–115

构建锦标赛树, from bottom to top a中不能包含T::minimal()这个特殊值，pop需要用到T::minimal()做临界值

(data: &[K])

/// 构建锦标赛树, from bottom to top
/// a中不能包含T::minimal()这个特殊值，pop需要用到T::minimal()做临界值
fn do_build<K, V>(data: &[K]) -> Tree<K, V>
where
    K: Copy + std::cmp::Ord,
{
    //build leaf
    let mut nodes: Vec<NonNull<Node<K, V>>> = data.iter().map(|v| Node::new_key(*v)).collect();
    while nodes.len() > 1 {
        nodes = nodes
            .chunks(2)
            .map(|chunk| match *chunk {
                [t1, t2] => unsafe { branch(t1, t2) },
                [t] => t,
                _ => unreachable!(),
            })
            .collect();
    }

    let mut tree = Tree::default();
    tree.root = nodes.first().cloned();
    tree
}

/// 创建分支节点，取t1, t2较大者的value构造parent
unsafe fn branch<K, V>(