public List <string> AddNodes()
{
int[] values = new[] { 6, 9, 8, 7 };
foreach (int value in values)
{
root.AddNode(value.ToString(), value);
}
PostOrderBinaryTreeTraversal p = new PostOrderBinaryTreeTraversal();
p.TraversePostorder(root);
return(new List <string>());
}
public void AddNode_AddEightRandomNumbers_OrderIsSorted()
{
BinaryNode<int> root = new BinaryNode<int>(4);
List<int> expected = new List<int>() { 4 };
Random rand = new Random();
for (int i = 0; i < 8; i++)
{
int x = rand.Next(0, 100);
root.AddNode(x);
expected.Add(x);
}
root.TraverseInorder();
expected.Sort();
Assert.AreEqual(expected, root.TreeListing);
}