BinaryTreeTests.BinaryTreeTests.Test_Remove_T_CASE2_1 C# (CSharp) Method

        public void Test_Remove_T_CASE2_1()
        {
            // CASE 2: If current's right child has no left child, then current's right child
            //         replaces current in the tree

            // 1st
            var tree = new BinaryTree<int> { 90, 50, 150, 20, 125, 175, 5, 25, 140 };
            tree.Remove(150);
            var expectedTree = new BinaryTree<int> { 90, 50, 175, 20, 125, 5, 25, 140 };

            Assert.AreEqual(true, tree == expectedTree);
        }