public void IsBalanced_NotBalanced()
{
root.Left = new TreeNode <int>(12);
root.Left.Left = new TreeNode <int>(4);
root.Left.Right = new TreeNode <int>(78);
root.Left.Right.Left = new TreeNode <int>(22);
root.Right = new TreeNode <int>(100);
Assert.False(BinaryTreeExamples.IsBalanced(root));
}
public void IsBalanced_RootNodeHasTwoSubTrees()
{
root.Left = new TreeNode <int>(12);
root.Left.Left = new TreeNode <int>(4);
root.Left.Right = new TreeNode <int>(78);
root.Right = new TreeNode <int>(100);
root.Right.Left = new TreeNode <int>(89);
root.Right.Right = new TreeNode <int>(112);
Assert.True(BinaryTreeExamples.IsBalanced(root));
}
public void CreateTree_ShouldCreateATreeWithMinimalHeight_Even()
{
var tree = BinaryTreeExamples.CreateTree(new int[] {
1, 2, 3, 4
});
Assert.Equal(tree.Value, 1);
Assert.Equal(tree.Left.Value, 2);
Assert.Equal(tree.Right.Value, 3);
Assert.Equal(tree.Left.Left.Value, 4);
Assert.Null(tree.Left.Right);
}
public void IsBalanced_OnlyRootNode()
{
Assert.True(BinaryTreeExamples.IsBalanced(root));
}
