public void RootShouldHaveHeightOneAsLeaf()
{
var binarySearchTree = new BinarySearchTreeAvl <int>();
binarySearchTree.Add(1);
binarySearchTree.Root.Height.Should().Be(1);
}
public void ShouldDoNothingInEmptyTree()
{
var binaryTree = new BinarySearchTreeAvl <int>();
binaryTree.Remove(1);
binaryTree.Root.Should().BeNull();
}
public void RootShouldHaveHeight1WithChildren()
{
var binarySearchTree = new BinarySearchTreeAvl <int>();
binarySearchTree.Add(1);
binarySearchTree.Add(2);
binarySearchTree.Root.Height.Should().Be(2);
}
public void ShouldDeleteRootWhenIsRoot()
{
var binaryTree = new BinarySearchTreeAvl <int>();
binaryTree.Add(1);
binaryTree.Remove(1);
binaryTree.Root.Should().BeNull();
}
public void ShouldRemoveNodeIfIsLeaf()
{
var binaryTree = new BinarySearchTreeAvl <int>();
binaryTree.Add(1);
binaryTree.Add(2);
binaryTree.Remove(2);
binaryTree.Root.IsLeaf().Should().BeTrue();
}
public void AddLessThanRott()
{
binarySearchTree = new BinarySearchTreeAvl <int>();
binarySearchTree.Add(rootValue);
binarySearchTree.Add(valueAdded);
}
public void AddGreaterValue()
{
binarySearchTree = new BinarySearchTreeAvl <int>();
binarySearchTree.Add(rootValue);
binarySearchTree.Add(valueAdded);
}
public void AddToEmptyList()
{
binarySearchTree = new BinarySearchTreeAvl <int>();
binarySearchTree.Add(rootValue);
binarySearchTree.Add(rootValue);
}
public void TestDoubleRightRotationInRoot()
{
tree = new BinarySearchTreeAvl <int>();
tree.Add(1, -1, 0);
}
public void TestSingleLeftRotationInRoot()
{
tree = new BinarySearchTreeAvl <int>();
tree.Add(1, 0, -1);
}
public void TestSingleRightRotationInRoot()
{
tree = new BinarySearchTreeAvl <int>();
tree.Add(1, 2, 3);
}
public void AddToEmptyList()
{
binarySearchTree = new BinarySearchTreeAvl <int>();
binarySearchTree.Add(valueAdded);
}
public void CreateTree()
{
binaryTree = new BinarySearchTreeAvl <int>();
binaryTree.Add(1, -1, 2, 3);
binaryTree.Remove(2);
}
