public void Test_Remove_T_CASE3_4()
{
// CASE 3: If current's right child has a left child, replace current with current's
// right child's left-most descendent
var tree = new BinaryTree<int> { 90, 50, 150, 20, 75, 5, 66, 80, 68 };
tree.Remove(90);
var expectedTree = new BinaryTree<int> { 150, 50, 20, 75, 5, 66, 80, 68 };
Assert.AreEqual(true, tree == expectedTree);
}