public void FirstGreaterTest()
{
Func <BinaryTreeNode <int>, int, int>[] functions = new Func <BinaryTreeNode <int>, int, int>[]
{
FirstGreater.BruteForce,
FirstGreater.Search
};
for (int i = 0; i < 10; i++)
{
BinaryTreeNode <int> root = BinarySearchTreeUtilities.CreateRandomBinarySearchTree(10, 0, 15);
for (int j = 0; j <= 16; j++)
{
Tests.TestFunctions(root, j, functions);
}
}
}
