Function t_rotate_left

src/tree/binary/rb.rs:312–343

()

#[test]
fn t_rotate_left() {
    use crate::tree::binary::traverse::{InOrderVisitor, PreOrderVisitor};
    use crate::tree::binary::Tree;

    /*
         10
        /  \
       5   15
         /    \
        14    16
    */
    let mut tree = Tree::default();
    for v in vec![10, 5, 15, 14, 16] {
        let p = unsafe { bst::insert(tree.root, v, v).ok() };
        if tree.root.is_none() {
            tree.root = p;
        }
    }

    /*
        15
       /  \
      10  16
     /  \
    5   14
     */
    unsafe {
        tree.root = rotate_left(tree.root, tree.root.unwrap());
        assert_eq!(PreOrderVisitor::recursive(&tree), vec![15, 10, 5, 14, 16]);
        assert_eq!(InOrderVisitor::recursive(&tree), vec![5, 10, 14, 15, 16]);
    }
}

#[test]
fn t_rotate_right() {