public void SymmetricalNormalBinaryTree()
{
BinaryTreeNode <int> root = new BinaryTreeNode <int>(23);
root.Left = new BinaryTreeNode <int>(12);
root.Right = new BinaryTreeNode <int>(12);
root.Left.Left = new BinaryTreeNode <int>(98);
root.Right.Right = new BinaryTreeNode <int>(98);
Assert.True(IsTreeSymmetrical.IsSymmetrical(root));
}
public void FullBinaryTreeSameValue()
{
BinaryTreeNode <int> root = new BinaryTreeNode <int>(7);
root.Left = new BinaryTreeNode <int>(7);
root.Right = new BinaryTreeNode <int>(7);
root.Left.Left = new BinaryTreeNode <int>(7);
root.Left.Right = new BinaryTreeNode <int>(7);
root.Right.Left = new BinaryTreeNode <int>(7);
root.Right.Right = new BinaryTreeNode <int>(7);
Assert.True(IsTreeSymmetrical.IsSymmetrical(root));
}
public void FullBinaryTreeWithSymmetricalStructureButNotValue()
{
BinaryTreeNode <int> root = new BinaryTreeNode <int>(23);
root.Left = new BinaryTreeNode <int>(65);
root.Right = new BinaryTreeNode <int>(65);
root.Left.Left = new BinaryTreeNode <int>(98);
root.Left.Right = new BinaryTreeNode <int>(5);
root.Right.Left = new BinaryTreeNode <int>(45);
root.Right.Right = new BinaryTreeNode <int>(98);
Assert.False(IsTreeSymmetrical.IsSymmetrical(root));
}
public void UnsymmetricalFullBinaryTree()
{
BinaryTreeNode <int> root = new BinaryTreeNode <int>(23);
root.Left = new BinaryTreeNode <int>(65);
root.Right = new BinaryTreeNode <int>(12);
root.Left.Left = new BinaryTreeNode <int>(98);
root.Left.Right = new BinaryTreeNode <int>(45);
root.Right.Left = new BinaryTreeNode <int>(112);
root.Right.Right = new BinaryTreeNode <int>(111);
Assert.False(IsTreeSymmetrical.IsSymmetrical(root));
}
public void InvalidInput()
{
BinaryTreeNode <int> root = null;
Assert.Throws <ArgumentNullException>(() => IsTreeSymmetrical.IsSymmetrical(root));
}
public void BinaryTreeWithOnlyOneNode()
{
BinaryTreeNode <int> root = new BinaryTreeNode <int>(23);
Assert.True(IsTreeSymmetrical.IsSymmetrical(root));
}
