[剑指offer][面试题18]树的子结构

#include <iostream>
using namespace std;

struct Node{
int   m_nData;
Node *m_pLeft;
Node *m_pRight;
};

bool isSubTreeFromHere(Node *pRoot0, Node *pRoot1)
{
if (pRoot1==NULL){
return true;
}

if (pRoot0==NULL){
return false;
}

if (pRoot0->m_nData != pRoot1->m_nData){
return false;
}

return isSubTreeFromHere(pRoot0->m_pLeft, pRoot1->m_pLeft) & isSubTreeFromHere(pRoot0->m_pRight, pRoot1->m_pRight);
}

bool isSubTree(Node *pRoot0, Node *pRoot1)
{
bool bIsSubTree = false;

if (pRoot0!=NULL && pRoot1!=NULL){
bIsSubTree = isSubTreeFromHere(pRoot0, pRoot1);

if (!bIsSubTree){
bIsSubTree = isSubTree(pRoot0->m_pLeft, pRoot1);
}
if (!bIsSubTree){
bIsSubTree = isSubTree(pRoot0->m_pRight, pRoot1);
}
}

return bIsSubTree;
}

int main()
{

}