예제 #1
0
        public void CreateFullBinaryTreeWithRepeat_CheckForSearch_SearchFound()
        {
            ////Arrange
            MyBinaryList list1 = new MyBinaryList();

            list1.Add(1);
            list1.Add(2);
            list1.Add(3);
            list1.Add(2);
            ////Act
            bool searchFound = list1.Search(2);

            //Assert
            Assert.AreEqual(searchFound, true);
        }
예제 #2
0
        public void CreateAllRightBinaryTree_CheckForSearch_SearchFound()
        {
            ////Arrange
            MyBinaryList list1 = new MyBinaryList();

            for (int i = 1; i < 3; i++)
            {
                list1.Add(i);
            }
            ////Act
            bool searchFound = list1.Search(2);

            //Assert
            Assert.AreEqual(searchFound, true);
        }