Exemplo n.º 1
0
        public void TestingBreathFirstSearchRecurcive(int[] arr, int[] expected)
        {
            //var Expected = new List<int>() { 9, 4, 20, 1, 6, 15, 170 };

            var binarySearchTree = new BinarySearchTree();

            for (int i = 0; i < arr.Length; i++)
            {
                binarySearchTree.Insert(arr[i]);
            }

            List <int>       list  = new List <int>();
            Queue <TreeNode> queue = new Queue <TreeNode>();

            queue.Enqueue(binarySearchTree.root);

            var breadthFirstSearch = new BreadthFirstSearch();
            var result             = breadthFirstSearch.BreathFirstSearchRecurcive(queue, list);

            Assert.AreEqual(expected, result);
        }