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