public void Insert(int[] data)
{
var binaryTree = new Algorithms.Trees.BinaryTree.Tree <int>();
foreach (var item in data)
{
binaryTree.Insert(item);
}
}
public void Export_PostOrder(int[] data, int[] expected)
{
// arrange
var binaryTree = new Algorithms.Trees.BinaryTree.Tree <int>();
foreach (var item in data)
{
binaryTree.Insert(item);
}
var nodes = binaryTree.ExportPostOrder().ToArray();
CollectionAssert.AreEqual(expected, nodes);
}
public void Find(int[] data, int element, int expected)
{
// arrange
var binaryTree = new Algorithms.Trees.BinaryTree.Tree <int>();
foreach (var item in data)
{
binaryTree.Insert(item);
}
var node = binaryTree.Find(element);
Assert.AreEqual(expected, node);
}
public void Remove(int[] data, int memberToRemove, int[] expectedPreOrder)
{
// arrange
var binaryTree = new Algorithms.Trees.BinaryTree.Tree <int>();
foreach (var item in data)
{
binaryTree.Insert(item);
}
binaryTree.Remove(memberToRemove);
var nodes = binaryTree.ExportPreOrder().ToArray();
CollectionAssert.AreEqual(expectedPreOrder, nodes);
}
