Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using Microsoft.VisualStudio.TestTools.UnitTesting;
- using System;
- using AVLTree;
- namespace AVLTests
- {
- [TestClass]
- public class UnitTest1
- {
- [TestMethod]
- public void CountIncreaseAfterAdding()
- {
- var tree = new AVLTree<int, int>();
- int n = 10;
- for (int i = 0; i < n; i++)
- {
- tree.Add(i, i);
- }
- Assert.AreEqual(n, tree.Count);
- }
- [TestMethod]
- public void ItemsExistAfterAdding()
- {
- var tree = new AVLTree<int, int>();
- var a = new[] { 22, 30, 15, 5, 17, 24, 33, 10, 16, 26 };
- int n = a.Length;
- for (int i = 0; i < n; i++)
- {
- tree.Add(a[i], i);
- }
- Assert.AreEqual(n, tree.Count);
- Array.Sort(a);
- int j = 0;
- foreach (var pair in tree)
- {
- Assert.AreEqual(a[j], pair.Key);
- j++;
- }
- }
- [TestMethod]
- public void ContainsExistingElement()
- {
- var tree = new AVLTree<int, int>();
- var a = new[] { 8, 3, 10, 1, 6, 14, 4, 7, 13 };
- for (int i = 0; i < a.Length; i++)
- {
- tree.Add(a[i], 0);
- }
- Assert.AreEqual(true, tree.Contains(6, 0));
- }
- [TestMethod]
- public void ContainsNotExistingElement()
- {
- var tree = new AVLTree<int, int>();
- var a = new[] { 8, 3, 10, 1, 6, 14, 4, 7, 13 };
- for (int i = 0; i < a.Length; i++)
- {
- tree.Add(a[i], 0);
- }
- Assert.AreEqual(false, tree.Contains(37, 0));
- }
- [TestMethod]
- public void CountIncreaseAfterDelete()
- {
- var tree = new AVLTree<int, int>();
- int n = 10;
- for (int i = 0; i < n; i++)
- {
- tree.Add(i, i);
- }
- tree.Delete(0,0);
- Assert.AreEqual(n-1, tree.Count);
- }
- [TestMethod]
- public void ThreeElementAddAndDeleteRoot()
- {
- var tree = new AVLTree<int, int>();
- tree.Add(10, 10);
- tree.Add(4, 4);
- tree.Add(15, 15);
- tree.Add(3, 3);
- tree.Add(8, 8);
- tree.Add(13, 13);
- tree.Add(78, 78);
- tree.Delete(10, 10);
- Assert.AreEqual(tree.Contains(10,10), false);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement