比较二叉树是否相同

#include<iostream>
using namespace std;

typedef struct BTNode
{
int data;
struct BTNode *lchild,*rchild;
}BTNode;


void create(BTNode *&bt)
{
int data;
cin >> data;
if(data==0)
{
bt=NULL;
}
else
{
bt=new BTNode();
bt->data=data;
create(bt->lchild);
create(bt->rchild);
}
}

void print(BTNode *bt)
{
if(bt==NULL)
return;
BTNode *stack[100]; int top=-1;
stack[++top]=bt;
while(top!=-1)
{
BTNode *p=stack[top--];
cout << p->data << endl;
if(p->rchild!=NULL)
stack[++top]=p->rchild;
if(p->lchild!=NULL)
stack[++top]=p->lchild;
}
}



int compare(BTNode *bt1,BTNode *bt2)
{
if(bt1->data!=bt2->data)
return 0;
else
{
return compare(bt1->lchild,bt2->lchild);
return compare(bt1->rchild,bt2->rchild);
}
}

int main()
{
    BTNode *bt;
    BTNode *bt1;
    BTNode *bt2;
    cout << "创建1" << endl;
    create(bt);
    bt1=bt;
    cout << "创建2" << endl;
    create(bt);
    bt2=bt;
    cout << "比较结果" << endl;
    cout << compare(bt1,bt2) << endl;
    return 0;
}