比较两颗二叉树是否相等

struct BinaryNode
{
int m_iValue;
BinaryNode * m_pLeft;
BinaryNode * m_pRight;
};

bool IsEqual(BinaryNode* currentLeft, BinaryNode* currentRight)
{
//如果两个节点都是空
if(currentLeft==NULL && currentRight==NULL)
{
return 1;
}
//如果一个空一个非空
if(!currentLeft||!currentRight)
{
return 0;
}
//exit point
if(currentLeft->m_pLeft==NULL && currentLeft->m_pRight==NULL && currentRight->m_pLeft==NULL && currentRight->m_pRight==NULL)
{
return (currentLeft->m_iValue==currentRight->m_iValue);
}
else
{
//check left right child 递归来做
if(currentLeft->m_iValue==currentRight->m_iValue)
{
if(IsEqual(currentLeft->m_pLeft,currentRight->m_pLeft)&&IsEqual(currentLeft->m_pRight,currentRight->m_pRight))
{
return 1;
}
else if(IsEqual(currentLeft->m_pLeft,currentRight->m_pRight)&&IsEqual(currentLeft->m_pRight,currentRight->m_pLeft))
{
return 1;
}
else
{
return 0;
}
}
else
{
return 0;
}
}
}