判断二叉树是否对称

struct Node
{
	Node *left;
	Node *right;
	Node()
	{
		left = right = NULL;
	};
};

bool Judge(Node *leftRoot, Node *rightRoot)
{
	if(leftRoot != NULL && rightRoot != NULL)
	{
		if( Judge(leftRoot->left, rightRoot->right)  && Judge(leftRoot->right, rightRoot->left) )
			return true;
		else
			return false;
	}
	else if(leftRoot == NULL && rightRoot == NULL)
	{
		return true;
	}
	else
	{
		return false;
	}
}

bool JudgeTree(Node *root)
{
	if(root == NULL)
		return true;

	return Judge(root->left, root->right);
}