public void Test_Remove_T_CASE2_2()
{
// CASE 2: If current's right child has no left child, then current's right child
// replaces current in the tree
// 2nd
var tree = new BinaryTree<int> { 90, 50, 150, 175 };
tree.Remove(90);
var expectedTree = new BinaryTree<int> { 150, 50, 175 };
Assert.AreEqual(true, expectedTree == tree);
}