BinaryTreeTests.BinaryTreeTests.Test_Remove_T_CASE3_5 C# (CSharp) Method

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

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