public void PostOrderBalancingTest()
{
AVLTree<int> tree = new AVLTree<int>();
tree.Add(5);
tree.Add(6);
tree.Add(7);
tree.Add(8);
tree.Add(9);
tree.Add(3);
tree.Add(2);
tree.Add(1);
tree.Add(4);
int[] expected = new[] { 1, 2, 4, 5, 3, 7, 9, 8, 6 };
int index = 0;
tree.PostOrderTraversal(item => Assert.AreEqual(expected[index++], item, "The item enumerated in the wrong order"));
}
public void InOrderBalancingTest()
{
AVLTree<int> tree = new AVLTree<int>();
//No matter whatr the input is, output is sorted data
tree.Add(4);
tree.Add(5);
tree.Add(2);
tree.Add(7);
tree.Add(3);
tree.Add(6);
tree.Add(1);
tree.Add(8);
int[] expected = new[] { 1, 2, 3, 4, 5, 6, 7, 8 };
int index = 0;
tree.InOrderTraversal(item => Assert.AreEqual(expected[index++], item, "The item enumerated in the wrong order"));
}
public void SimpleTestIfBalancingWorks()
{
AVLTree<int> tree = new AVLTree<int>();
tree.Add(1);
tree.Add(2);
tree.Add(3);
tree.Add(4);
tree.Add(5);
int[] expected = new[] { 2, 1, 4, 3, 5 };
int index = 0;
tree.PreOrderTraversal(item => Assert.AreEqual(expected[index++], item, "The item enumerated in the wrong order"));
}
