public void Test_Remove_T_CASE1_2()
{
// CASE 1: If current has no right child, then current's left child becomes
// the node pointed to by the parent
// 2nd
var tree = new BinaryTree<int> { 90, 50, 20, 5, 25 };
tree.Remove(90);
var expectedTree = new BinaryTree<int> { 50, 20, 5, 25 };
Assert.AreEqual(true, expectedTree == tree);
}