BinaryTreeTests.BinaryTreeTests.Test_Remove_T_CASE3_3 C# (CSharp) Method

        public void Test_Remove_T_CASE3_3()
        {
            // 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, 125, 175, 5, 25, 66, 80, 140, 68, 123 };
            tree.Remove(90);
            var expectedTree = new BinaryTree<int> {123, 50, 150, 20, 75, 125, 175, 5, 25, 66, 80, 140, 68};

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