Function t_build_tree

src/tree/binary/builder/tournament.rs:133–166

()

#[test]
fn t_build_tree() {
    /*
                                            16
                        /                                       \
                     16                                           14
                 /         \                                /           \
            16                   13                    10                    14
         /     \               /     \               /    \                /     \
       7         16         8          13        10          9         12         14
     /  \       /  \       /  \       /  \      /   \      /  \       /  \       /  \
    7    6    15   16     8    4    13    3    5    10    9    1     12   2    11   14

    */
    let a = &[7, 6, 15, 16, 8, 4, 13, 3, 5, 10, 9, 1, 12, 2, 11, 14];

    let tree: Tree<i32, i32> = do_build(a);
    let r = unsafe { crate::tree::binary::traverse::PreOrderVisitor::recursive(&tree) };
    assert_eq!(
        r,
        vec![
            16, 16, 16, 7, 7, 6, 16, 15, 16, 13, 8, 8, 4, 13, 13, 3, 14, 10, 10, 5, 10, 9, 9, 1,
            14, 12, 12, 2, 14, 11, 14
        ]
    );

    let r = unsafe { crate::tree::binary::traverse::InOrderVisitor::recursive(&tree) };
    assert_eq!(
        r,
        vec![
            7, 7, 6, 16, 15, 16, 16, 16, 8, 8, 4, 13, 13, 13, 3, 16, 5, 10, 10, 10, 9, 9, 1, 14,
            12, 12, 2, 14, 11, 14, 14
        ]
    );
}

#[test]
fn t_pop() {