leetcode算法题--树的子结构

原题链接：https://leetcode-cn.com/problems/shu-de-zi-jie-gou-lcof/

bool isSubStructure(TreeNode *A, TreeNode* B) {//先序遍历根节点的子树
    return (A && B) && (recur(A, B) || isSubStructure(A->left, B) || isSubStructure(A->right, B));
}

bool recur(TreeNode *A,TreeNode *B) {//判断A节点为根节点的子树中是否包含B
    if(B == NULL) return true;
    if(A == NULL || A->val != B->val) return false;
    return recur(A->left, B->left) && recur(A->right, B->right); 
}