树的子结构

题目描述

输入两棵二叉树A，B，判断B是不是A的子结构。（ps：我们约定空树不是任意一个树的子结构）

 #include <iostream>
using namespace::std;
 struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
 val(x), left(nullptr), right(nullptr) {
}
 };
class Solution {
private:
int t = 0; 
public:
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
    if( pRoot2 == NULL || pRoot1 == NULL) return false;
    bool flag;
    if(pRoot1 ->val == pRoot2 ->val){
        t = 1;

        if(pRoot2->left == NULL && pRoot2->right == NULL) return true;
        if(pRoot1->left == NULL && pRoot2->left == NULL) flag = HasSubtree(pRoot1->right, pRoot2->right);
        else if(pRoot1->right == NULL && pRoot2->right == NULL) flag =  HasSubtree(pRoot1->left, pRoot2->left);
        else if(pRoot2 ->left == NULL) flag = HasSubtree(pRoot1->right, pRoot2->right);
        else if(pRoot1 ->left == NULL) return false;
        else if(pRoot2->right == NULL) flag = HasSubtree(pRoot1->left, pRoot2->left);
        else if(pRoot1->right == NULL) return false;
        else flag = HasSubtree(pRoot1->left, pRoot2->left) && HasSubtree(pRoot1->right, pRoot2->right);
       if(flag) return flag;
        t = 0;
    }
    if(t ==  0){
        if(pRoot1->left == NULL) flag = HasSubtree(pRoot1->right, pRoot2);
        else if(pRoot2->right == NULL) flag = HasSubtree(pRoot1->left, pRoot2);
        else flag = HasSubtree(pRoot1->left, pRoot2) || HasSubtree(pRoot1->right, pRoot2);
    }
    else flag = false;
    return flag;
}
};