use bst_rs::{BinarySearchTree, RecursiveBST};

#[test]
fn can_insert_element() {
    let mut bst = RecursiveBST::new(-1);

    bst.insert(0);
    bst.insert(1);
    bst.insert(1);
    bst.insert(2);

    assert_eq!(bst.size(), 4);
}

#[test]
fn check_if_bst_is_empty() {
    let mut bst = RecursiveBST::empty();
    assert!(bst.is_empty());

    bst.insert(1);
    assert!(!bst.is_empty());
}

#[test]
fn check_element_exists() {
    let mut bst = RecursiveBST::empty();

    bst.insert(1);
    bst.insert(5);

    assert!(!bst.contains(&10));
    assert!(bst.contains(&1));
    assert!(bst.contains(&5));
}

#[test]
fn remove_root_element() {
    let mut bst = RecursiveBST::empty();
    bst.insert(0);

    assert!(!bst.is_empty());
    assert_eq!(bst.size(), 1);

    bst.remove(&0);

    assert!(bst.is_empty());
    assert_eq!(bst.size(), 0)
}

#[test]
fn remove_leaf_node() {
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(5);
    expected_bst.insert(4);
    expected_bst.insert(6);
    let mut actual_bst = RecursiveBST::empty();
    actual_bst.insert(5);
    actual_bst.insert(4);
    actual_bst.insert(6);
    actual_bst.insert(7);

    actual_bst.remove(&7);

    assert_eq!(actual_bst.size(), 3);
    assert_eq!(actual_bst, expected_bst);
}

#[test]
fn remove_single_right_node_with_children() {
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(5);
    expected_bst.insert(4);
    expected_bst.insert(7);
    expected_bst.insert(8);
    let mut actual_bst = RecursiveBST::empty();
    actual_bst.insert(5);
    actual_bst.insert(4);
    actual_bst.insert(6);
    actual_bst.insert(7);
    actual_bst.insert(8);

    actual_bst.remove(&6);

    assert_eq!(actual_bst.size(), 4);
    assert_eq!(actual_bst, expected_bst);
}

#[test]
fn remove_single_left_node_with_children() {
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(5);
    expected_bst.insert(3);
    expected_bst.insert(2);
    expected_bst.insert(6);
    let mut actual_bst = RecursiveBST::empty();
    actual_bst.insert(5);
    actual_bst.insert(4);
    actual_bst.insert(6);
    actual_bst.insert(3);
    actual_bst.insert(2);

    actual_bst.remove(&4);

    assert_eq!(actual_bst.size(), 4);
    assert_eq!(actual_bst, expected_bst);
}

#[test]
fn remove_node_with_two_children() {
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(10);
    expected_bst.insert(3);
    expected_bst.insert(8);
    expected_bst.insert(15);
    let mut actual_bst = RecursiveBST::empty();
    actual_bst.insert(10);
    actual_bst.insert(5);
    actual_bst.insert(8);
    actual_bst.insert(3);
    actual_bst.insert(15);

    actual_bst.remove(&5);

    assert_eq!(actual_bst, expected_bst);
}

#[test]
fn does_not_fail_when_removing_non_existing_element() {
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(10);
    expected_bst.insert(5);
    expected_bst.insert(8);
    expected_bst.insert(3);
    expected_bst.insert(15);

    let mut actual_bst = RecursiveBST::empty();
    actual_bst.insert(10);
    actual_bst.insert(5);
    actual_bst.insert(8);
    actual_bst.insert(3);
    actual_bst.insert(15);

    actual_bst.remove(&20);

    assert_eq!(actual_bst.size(), 5);
    assert_eq!(actual_bst, expected_bst);
}

#[test]
fn retrieve_element() {
    let mut bst = RecursiveBST::empty();
    bst.insert(5);
    bst.insert(10);

    let retrieved_value = bst.retrieve(5);
    let invalid_value = bst.retrieve(15);

    assert_eq!(retrieved_value, Some(&5));
    assert_eq!(invalid_value, None);
}

#[test]
fn retrieve_element_as_mut_and_modify_bst() {
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(10);
    expected_bst.insert(2);

    let mut actual_bst = RecursiveBST::empty();
    actual_bst.insert(10);
    actual_bst.insert(5);

    let _retrieved_value_as_mut: &mut i32 = actual_bst.retrieve_as_mut(5).unwrap();
    *_retrieved_value_as_mut = 2;

    assert_eq!(actual_bst, expected_bst);
}

#[test]
fn get_min_from_bst() {
    let mut bst = RecursiveBST::empty();
    assert_eq!(bst.min(), None);

    bst.insert(5);
    bst.insert(3);
    bst.insert(1);
    bst.insert(15);

    assert_eq!(bst.min(), Some(&1));
}

#[test]
fn get_max_from_bst() {
    let mut bst = RecursiveBST::empty();
    assert_eq!(bst.max(), None);

    bst.insert(5);
    bst.insert(12);
    bst.insert(1);
    bst.insert(15);

    assert_eq!(bst.max(), Some(&15));
}

#[test]
fn remove_min_from_bst() {
    let mut bst = RecursiveBST::empty();
    assert_eq!(bst.remove_min(), None);

    bst.insert(5);
    assert_eq!(bst.remove_min(), Some(5));
    assert_eq!(bst.size(), 0);

    bst.insert(3);
    bst.insert(1);
    bst.insert(2);
    bst.insert(15);

    assert_eq!(bst.remove_min(), Some(1));
    assert!(bst.contains(&2));
    assert_eq!(bst.size(), 3);
}

#[test]
fn remove_max_from_bst() {
    let mut bst = RecursiveBST::empty();
    assert_eq!(bst.remove_max(), None);

    bst.insert(5);
    assert_eq!(bst.remove_max(), Some(5));
    assert_eq!(bst.size(), 0);

    bst.insert(3);
    bst.insert(1);
    bst.insert(15);
    bst.insert(10);

    assert_eq!(bst.remove_max(), Some(15));
    assert!(bst.contains(&10));
    assert_eq!(bst.size(), 3);
}

#[test]
fn pre_order_iter() {
    let mut bst = RecursiveBST::empty();
    bst.insert(3);
    bst.insert(4);
    bst.insert(5);
    bst.insert(1);
    bst.insert(2);

    let mut pre_order_iter = bst.pre_order_iter();

    assert_eq!(pre_order_iter.next(), Some(&3));
    assert_eq!(pre_order_iter.next(), Some(&1));
    assert_eq!(pre_order_iter.next(), Some(&2));
    assert_eq!(pre_order_iter.next(), Some(&4));
    assert_eq!(pre_order_iter.next(), Some(&5));
    assert_eq!(pre_order_iter.next(), None);

    bst.insert(10);

    let mut another_pre_order_iter = bst.pre_order_iter();

    assert_eq!(another_pre_order_iter.next(), Some(&3));
    assert_eq!(another_pre_order_iter.next(), Some(&1));
    assert_eq!(another_pre_order_iter.next(), Some(&2));
    assert_eq!(another_pre_order_iter.next(), Some(&4));
    assert_eq!(another_pre_order_iter.next(), Some(&5));
    assert_eq!(another_pre_order_iter.next(), Some(&10));
    assert_eq!(another_pre_order_iter.next(), None);
}

#[test]
fn in_order_iter() {
    let mut bst = RecursiveBST::empty();
    bst.insert(3);
    bst.insert(4);
    bst.insert(5);
    bst.insert(1);
    bst.insert(2);

    let mut in_order_iter = bst.in_order_iter();

    assert_eq!(in_order_iter.next(), Some(&1));
    assert_eq!(in_order_iter.next(), Some(&2));
    assert_eq!(in_order_iter.next(), Some(&3));
    assert_eq!(in_order_iter.next(), Some(&4));
    assert_eq!(in_order_iter.next(), Some(&5));
    assert_eq!(in_order_iter.next(), None);

    bst.insert(6);

    let mut another_in_order_iter = bst.in_order_iter();

    assert_eq!(another_in_order_iter.next(), Some(&1));
    assert_eq!(another_in_order_iter.next(), Some(&2));
    assert_eq!(another_in_order_iter.next(), Some(&3));
    assert_eq!(another_in_order_iter.next(), Some(&4));
    assert_eq!(another_in_order_iter.next(), Some(&5));
    assert_eq!(another_in_order_iter.next(), Some(&6));
    assert_eq!(another_in_order_iter.next(), None);
}

#[test]
fn post_order_iter() {
    let mut bst = RecursiveBST::empty();
    bst.insert(3);
    bst.insert(4);
    bst.insert(5);
    bst.insert(1);
    bst.insert(2);

    let mut post_order_iter = bst.post_order_iter();
    println!("{:?}", bst);

    assert_eq!(post_order_iter.next(), Some(&2));
    assert_eq!(post_order_iter.next(), Some(&1));
    assert_eq!(post_order_iter.next(), Some(&5));
    assert_eq!(post_order_iter.next(), Some(&4));
    assert_eq!(post_order_iter.next(), Some(&3));
    assert_eq!(post_order_iter.next(), None);

    bst.insert(10);

    let mut another_post_order_iter = bst.post_order_iter();

    assert_eq!(another_post_order_iter.next(), Some(&2));
    assert_eq!(another_post_order_iter.next(), Some(&1));
    assert_eq!(another_post_order_iter.next(), Some(&10));
    assert_eq!(another_post_order_iter.next(), Some(&5));
    assert_eq!(another_post_order_iter.next(), Some(&4));
    assert_eq!(another_post_order_iter.next(), Some(&3));
    assert_eq!(another_post_order_iter.next(), None);
}

#[test]
fn into_pre_order_iter() {
    let mut bst = RecursiveBST::empty();
    bst.insert(3);
    bst.insert(4);
    bst.insert(5);
    bst.insert(1);
    bst.insert(2);

    let mut pre_order_iter = bst.into_pre_order_iter();

    assert_eq!(pre_order_iter.next(), Some(3));
    assert_eq!(pre_order_iter.next(), Some(1));
    assert_eq!(pre_order_iter.next(), Some(2));
    assert_eq!(pre_order_iter.next(), Some(4));
    assert_eq!(pre_order_iter.next(), Some(5));
    assert_eq!(pre_order_iter.next(), None);
}

#[test]
fn into_in_order_iter() {
    let mut bst = RecursiveBST::empty();
    bst.insert(3);
    bst.insert(4);
    bst.insert(5);
    bst.insert(1);
    bst.insert(2);

    let mut in_order_iter = bst.into_in_order_iter();

    assert_eq!(in_order_iter.next(), Some(1));
    assert_eq!(in_order_iter.next(), Some(2));
    assert_eq!(in_order_iter.next(), Some(3));
    assert_eq!(in_order_iter.next(), Some(4));
    assert_eq!(in_order_iter.next(), Some(5));
    assert_eq!(in_order_iter.next(), None);
}

#[test]
fn into_post_order_iter() {
    let mut bst = RecursiveBST::empty();
    bst.insert(3);
    bst.insert(4);
    bst.insert(5);
    bst.insert(1);
    bst.insert(2);

    let mut post_order_traversal = bst.into_post_order_iter();

    assert_eq!(post_order_traversal.next(), Some(2));
    assert_eq!(post_order_traversal.next(), Some(1));
    assert_eq!(post_order_traversal.next(), Some(5));
    assert_eq!(post_order_traversal.next(), Some(4));
    assert_eq!(post_order_traversal.next(), Some(3));
    assert_eq!(post_order_traversal.next(), None);
}

#[test]
fn get_sorted_vec() {
    let mut bst = RecursiveBST::empty();
    bst.insert(3);
    bst.insert(4);
    bst.insert(5);
    bst.insert(1);
    bst.insert(2);

    assert_eq!(bst.sorted_vec(), vec![&1, &2, &3, &4, &5]);
}

#[test]
fn bst_into_sorted_vec() {
    let mut bst = RecursiveBST::empty();
    bst.insert(3);
    bst.insert(4);
    bst.insert(5);
    bst.insert(1);
    bst.insert(2);

    assert_eq!(bst.into_sorted_vec(), vec![1, 2, 3, 4, 5]);
}

#[test]
fn get_pre_order_vec() {
    let mut bst = RecursiveBST::empty();
    bst.insert(3);
    bst.insert(4);
    bst.insert(5);
    bst.insert(1);
    bst.insert(2);

    assert_eq!(bst.pre_order_vec(), vec![&3, &1, &2, &4, &5]);
}

#[test]
fn get_in_order_vec() {
    let mut bst = RecursiveBST::empty();
    bst.insert(3);
    bst.insert(4);
    bst.insert(5);
    bst.insert(1);
    bst.insert(2);

    assert_eq!(bst.in_order_vec(), vec![&1, &2, &3, &4, &5]);
}

#[test]
fn get_post_order_vec() {
    let mut bst = RecursiveBST::empty();
    bst.insert(3);
    bst.insert(4);
    bst.insert(5);
    bst.insert(1);
    bst.insert(2);

    assert_eq!(bst.post_order_vec(), vec![&2, &1, &5, &4, &3]);
}

#[test]
fn create_bst_from_vec() {
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(10);
    expected_bst.insert(20);
    expected_bst.insert(5);
    expected_bst.insert(30);

    let actual_bst = RecursiveBST::from(vec![10, 20, 5, 30]);

    assert_eq!(actual_bst, expected_bst);
}

#[test]
fn create_bst_from_slice() {
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(10);
    expected_bst.insert(20);
    expected_bst.insert(5);
    expected_bst.insert(30);

    let actual_bst = RecursiveBST::from(vec![10, 20, 5, 30].as_slice());

    assert_eq!(actual_bst, expected_bst);
}

#[test]
fn create_bst_from_into_vec() {
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(10);
    expected_bst.insert(20);
    expected_bst.insert(5);
    expected_bst.insert(30);

    let actual_bst: RecursiveBST<i32> = vec![10, 20, 5, 30].into();

    assert_eq!(actual_bst, expected_bst);
}

#[test]
fn extend_bst_from_iter() {
    let vec = vec![8, 1, 10];
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(3);
    expected_bst.insert(2);
    expected_bst.insert(5);
    expected_bst.insert(8);
    expected_bst.insert(1);
    expected_bst.insert(10);
    let mut actual_bst = RecursiveBST::empty();
    actual_bst.insert(3);
    actual_bst.insert(2);
    actual_bst.insert(5);

    actual_bst.extend(vec.into_iter());

    assert_eq!(actual_bst.size(), 6);
    assert_eq!(actual_bst, expected_bst);
}

#[test]
fn create_bst_from_iter() {
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(3);
    expected_bst.insert(2);
    expected_bst.insert(5);
    expected_bst.insert(8);
    expected_bst.insert(1);
    expected_bst.insert(10);

    let actual_bst = RecursiveBST::from_iter(vec![3, 2, 5, 8, 1, 10].into_iter());

    assert_eq!(actual_bst, expected_bst);
}

#[test]
fn clone_bst() {
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(3);
    expected_bst.insert(2);
    expected_bst.insert(5);
    expected_bst.insert(8);
    expected_bst.insert(1);
    expected_bst.insert(10);

    let cloned_bst = expected_bst.clone();

    assert_eq!(cloned_bst, expected_bst);
}

#[test]
fn clone_into_another_bst() {
    let mut actual_bst = RecursiveBST::empty();
    actual_bst.insert(3);
    actual_bst.insert(2);
    let mut expected_bst = RecursiveBST::empty();
    expected_bst.insert(3);
    expected_bst.insert(2);
    expected_bst.insert(5);
    expected_bst.insert(8);
    expected_bst.insert(1);
    expected_bst.insert(10);
    assert_ne!(actual_bst, expected_bst);

    actual_bst.clone_from(&expected_bst);

    assert_eq!(actual_bst, expected_bst);
}