摘要:
1.递归判断相等#include "stdafx.h"#include<iostream>using namespace std;typedef struct BTreeNode{ int data; struct BTreeNode *lchild,*rchild;}BTree;int _tmain(int argc, _TCHAR* argv[]){ return 0;}bool equal(BTree *p,BTree *q){ if(!p&&!q)return true;//若都为空 else if(!p&&q||p&am 阅读全文