BinaryTreeTests.BinaryTreeTests.Test_Remove_T_CASE3_2 C# (CSharp) Method

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

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