int compTree(TreeNode *tree1, TreeNode *tree2)
{
if(!tree1 && !tree2) return 1;
if((tree1 && !tree2) ||(!tree1 && tree2)) return 0;
if(tree1 && tree2)
{
if(tree1->c==tree2->c)
{
if(compTree(tree1->leftChild, tree2->leftChild))
return compTree(tree1->rightChild, tree2->rightChild);
else if(compTree(tree1->rightChild, tree2->leftChild))
return compTree(tree1->leftChild, tree2->rightChild);
}
}
return 0; } 时间复杂度:从代码中可以看出,需要对两棵树都进行遍历,因此时间复杂度是O(N) 空间复杂度:应该是常数级别