数据结构与算法分析——c语言描述 练习4.41 答案
int isSimilar(SearchTree t1, SearchTree t2) {
if (t1 == NULL&&t2 == NULL)
return 1;
else if (t1 && t2) {
return isSimilar(t1->left, t2->left) && isSimilar(t1->right, t2->right);
}
else
return 0;
}
数据结构与算法分析——c语言描述 练习4.41 答案
int isSimilar(SearchTree t1, SearchTree t2) {
if (t1 == NULL&&t2 == NULL)
return 1;
else if (t1 && t2) {
return isSimilar(t1->left, t2->left) && isSimilar(t1->right, t2->right);
}
else
return 0;
}