public void NotNullWhenAddNodeDefault()
{
var viewModel = new BinaryTree();
viewModel.AddNodeCommand.Execute(null);
Assert.IsNotNull(viewModel.HeadNode);
}
public void CorrectNodesWhenDefaultPathEntered()
{
//arrange
var vm = new BinaryTree();
//act
vm.AddDefaultTreeCommand.Execute(null);
//assert
Assert.IsTrue(vm.Contains(BinaryTree.NodeList[1]));
}
public void CorrectOrderWhenTwoEnteredLargeSmall()
{
var viewModel = new BinaryTree();
viewModel.AddSearchNode(new Node
{
Value = 10
});
viewModel.AddSearchNode(new Node
{
Value = 5
});
Assert.IsNotNull(viewModel.HeadNode);
Assert.IsNotNull(viewModel.HeadNode.LeftNode);
}
public void NullWhenAddNodeEntranceNull()
{
var viewModel = new BinaryTree { CurrentValue = 4 };
viewModel.AddNodeEntrance(null);
Assert.IsNotNull(viewModel.HeadNode);
}
public void SuccessWhenHeadNodeInserted()
{
var vm = new BinaryTree();
var list = BinaryTree.NodeList;
vm.AddBalancedNode(list[0]);
Assert.IsTrue(vm.HeadNode == list[0]);
}
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 SuccessWhenBinarySearchTree()
{
var vm = new BinaryTree();
vm.AddDefaultTreeEntrance(null);
Assert.IsTrue(vm.IsThisBinaryTree());
}
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());
}
public void FailureWhenHeadRightChildLeftChildSmallerThanHead()
{
var vm = new BinaryTree();
var headNode = new Node { Value = 2 };
headNode.RightNode = new Node { Value = 3 };
//this should be head.left
headNode.RightNode.LeftNode = new Node { Value = 1 };
vm.HeadNode = headNode;
Assert.IsFalse(vm.IsThisBinaryTree());
}
public void SuccessWhenRemoveNodeRightChildNoLeftChild()
{
//arrange
var vm = new BinaryTree();
var rightChildHasNoLeft = new List<Node>
{
new Node{Value = 4, IsExpanded = true, IsSelected = true},
new Node{Value = 6, IsExpanded = true},
new Node{Value = 5, IsExpanded = true},
new Node{Value = 7, IsExpanded = true},
new Node{Value = 8, IsExpanded = true},
};
rightChildHasNoLeft.ForEach(vm.AddSearchNode);
var sixthNode = rightChildHasNoLeft.First(t => t.Value == 6);
//act
vm.RemoveNodeEntrance(sixthNode);
//assert
Assert.IsFalse(vm.Contains(sixthNode));
Assert.IsTrue(vm.HeadNode.RightNode.Value == 7);
Assert.IsTrue(vm.HeadNode.RightNode.LeftNode.Value == 5);
Assert.IsTrue(vm.HeadNode.RightNode.RightNode.Value == 8);
}
public void SuccessWhenRemoveNodeNorightChild()
{
//arrange
var vm = new BinaryTree();
vm.AddDefaultTreeCommand.Execute(null);
var eightNode = BinaryTree.NodeList.First(t => t.Value == 8);
//act
vm.RemoveNodeEntrance(eightNode);
//assert
Assert.IsFalse(vm.Contains(eightNode));
Assert.IsTrue(vm.HeadNode.RightNode.Value == 6);
Assert.IsTrue(vm.HeadNode.RightNode.LeftNode.Value == 5);
Assert.IsTrue(vm.HeadNode.RightNode.RightNode.Value == 7);
}
public void CorrectOrderWhenFiveEntered()
{
//arrange
/* before
10
5
4 6
2
*/
//remove 5
/* after
10
4
2 6
*/
var viewModel = new BinaryTree();
viewModel.AddSearchNode(new Node
{
Value = 10
});
var node = new Node
{
Value = 5
};
viewModel.AddSearchNode(node);
viewModel.AddSearchNode(new Node
{
Value = 4
});
viewModel.AddSearchNode(new Node
{
Value = 6
});
viewModel.AddSearchNode(new Node
{
Value = 2
});
//state check
Assert.IsTrue(viewModel.Contains(node));
//act
viewModel.RemoveNode(node);
//assert
Assert.IsFalse(viewModel.Contains(node));
}
