fix BST tests for tree

Author: justcoding121

Advanced.Algorithms.Tests/DataStructures/Queues/CircularQueue_Tests.cs

@@ -0,0 +1,63 @@
+using Advanced.Algorithms.DataStructures;
+using Advanced.Algorithms.DataStructures.DistributedSystems;
+using Advanced.Algorithms.DataStructures.Queues;
+using Microsoft.VisualStudio.TestTools.UnitTesting;
+
+namespace Advanced.Algorithms.Tests.DataStructures.Queues
+{
+    [TestClass]
+    public class CircularQueue_Tests
+    {
+
+        [TestMethod]
+        public void CircularQueue_Test()
+        {
+            var Queue = new CircularQueue<int>(7);
+
+            Assert.AreEqual(0, Queue.Enqueue(1));
+            Assert.AreEqual(0, Queue.Enqueue(2));
+
+            Assert.AreEqual(0, Queue.Enqueue(3));
+            Assert.AreEqual(0, Queue.Enqueue(4));
+            Assert.AreEqual(0, Queue.Enqueue(5));
+            Assert.AreEqual(0, Queue.Enqueue(6));
+            Assert.AreEqual(0, Queue.Enqueue(7));
+            Assert.AreEqual(1, Queue.Enqueue(8));
+            Assert.AreEqual(2, Queue.Enqueue(9));
+
+            Assert.AreEqual(Queue.Count, 7);
+            Assert.AreEqual(3, Queue.Dequeue());
+
+            Assert.AreEqual(Queue.Count, 6);
+            Assert.AreEqual(Queue.Dequeue(), 4);
+
+            Assert.AreEqual(Queue.Count, 5);
+            Assert.AreEqual(Queue.Dequeue(), 5);
+
+            Assert.AreEqual(Queue.Count, 4);
+            Assert.AreEqual(Queue.Dequeue(), 6);
+
+            Assert.AreEqual(Queue.Count, 3);
+            Assert.AreEqual(Queue.Dequeue(), 7);
+
+            Assert.AreEqual(Queue.Count, 2);
+            Assert.AreEqual(Queue.Dequeue(), 8);
+
+            Assert.AreEqual(Queue.Count, 1);
+            Assert.AreEqual(Queue.Dequeue(), 9);
+
+            Assert.AreEqual(Queue.Count, 0);
+
+            Assert.AreEqual(0, Queue.Enqueue(1));
+            Assert.AreEqual(0, Queue.Enqueue(2));
+
+            Assert.AreEqual(Queue.Count, 2);
+            Assert.AreEqual(1, Queue.Dequeue());
+
+            Assert.AreEqual(Queue.Count, 1);
+            Assert.AreEqual(Queue.Dequeue(), 2);
+        }
+
+
+    }
+}

Advanced.Algorithms.Tests/DataStructures/Tree/AVLTree_Tests.cs

@@ -109,7 +109,7 @@ public void AVLTree_AccuracyTest()
 
                 Assert.IsTrue(tree.HasItem(randomNumbers[i]));
 
-                Assert.IsTrue(BinarySearchTreeTester<int>.VerifyIsBinarySearchTree(tree.Root));
+                Assert.IsTrue(BinarySearchTreeTester<int>.VerifyIsBinarySearchTree(tree.Root, int.MinValue, int.MaxValue));
 
                 var actualHeight = tree.GetHeight();
 
@@ -128,7 +128,7 @@ public void AVLTree_AccuracyTest()
             {
                 tree.Delete(randomNumbers[i]);
 
-                Assert.IsTrue(BinarySearchTreeTester<int>.VerifyIsBinarySearchTree(tree.Root));
+                Assert.IsTrue(BinarySearchTreeTester<int>.VerifyIsBinarySearchTree(tree.Root, int.MinValue, int.MaxValue));
 
                 var actualHeight = tree.GetHeight();
 

Advanced.Algorithms.Tests/DataStructures/Tree/RedBlackTree_Tests.cs

@@ -65,7 +65,7 @@ public void RedBlackTree_AccuracyTest()
             {
                 tree.Insert(randomNumbers[i]);
                 Assert.IsTrue(tree.HasItem(randomNumbers[i]));
-                Assert.IsTrue(BinarySearchTreeTester<int>.VerifyIsBinarySearchTree(tree.Root));
+                Assert.IsTrue(BinarySearchTreeTester<int>.VerifyIsBinarySearchTree(tree.Root, int.MinValue, int.MaxValue));
 
                 var actualHeight = tree.GetHeight();
 
@@ -85,7 +85,7 @@ public void RedBlackTree_AccuracyTest()
             for (int i = 0; i < nodeCount; i++)
             {
                 tree.Delete(randomNumbers[i]);
-                Assert.IsTrue(BinarySearchTreeTester<int>.VerifyIsBinarySearchTree(tree.Root));
+                Assert.IsTrue(BinarySearchTreeTester<int>.VerifyIsBinarySearchTree(tree.Root, int.MinValue, int.MaxValue));
 
                 var actualHeight = tree.GetHeight();
 

Advanced.Algorithms.Tests/DataStructures/Tree/TestHelpers/BinarySearchTreeTester.cs

@@ -9,20 +9,15 @@ namespace Advanced.Algorithms.Tests.DataStructures.Tree.TestHelpers
 {
     public class BinarySearchTreeTester<T> where T:IComparable
     {
-
-        public static bool VerifyIsBinarySearchTree(IBSTNode<T> node)
-        {
-            return VerifyIsBinarySearchTree(node, int.MinValue, int.MaxValue);
-        }
 
-        public static bool VerifyIsBinarySearchTree(IBSTNode<T> node, int lowerBound, int upperBound)
+        public static bool VerifyIsBinarySearchTree(IBSTNode<T> node, T lowerBound, T upperBound)
         {
             if (node == null)
             {
                 return true;
             }
 
-             if (node.Value >= upperBound || node.Value <= lowerBound)
+             if (node.Value .CompareTo(upperBound)>= 0 || node.Value.CompareTo(lowerBound) <= 0)
             {
                 return false;
             }

Advanced.Algorithms/DataStructures/Tree/Interfaces.cs

@@ -8,5 +8,6 @@ public interface IBSTNode<T> where T : IComparable
         IBSTNode<T> Right { get;  }
 
         T Value { get;  }
+
     }
 }