public void SuccessWhenFiveInserted()
{
var vm = new BinaryTree();
var list = BinaryTree.NodeList;
for (var i = 0; i < 6; i++)
{
vm.AddBalancedNode(list[i]);
}
Assert.IsTrue(vm.HeadNode == list[0]);
Assert.IsTrue(vm.HeadNode.LeftNode == list[1]);
Assert.IsTrue(vm.HeadNode.RightNode == list[2]);
Assert.IsTrue(vm.HeadNode.LeftNode.LeftNode == list[3]);
Assert.IsTrue(vm.HeadNode.LeftNode.RightNode == list[4]);
}
public void SuccessWhenHeadNodeInserted()
{
var vm = new BinaryTree();
var list = BinaryTree.NodeList;
vm.AddBalancedNode(list[0]);
Assert.IsTrue(vm.HeadNode == list[0]);
}
public void FailureWhenNotBinarySearchTree()
{
var vm = new BinaryTree();
var list = BinaryTree.NodeList;
for (var i = 0; i < 6; i++)
{
vm.AddBalancedNode(list[i]);
}
Assert.IsFalse(vm.IsThisBinaryTree());
}
