leetcode:100相同的数

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

bool isSameTree(struct TreeNode* p, struct TreeNode* q){
    if(p==NULL&&q==NULL)
        return true;
    if(p==NULL || q == NULL)
        return false;
    if(p->val != q->val)
    {
        return false;
    }
    return isSameTree(p->left,q->left)&&
        isSameTree(p->right,q->right);
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

 bool CompareChild(struct TreeNode* p, struct TreeNode* q)
 { // 判断具有孩子个数和格式是否相同
    if(p==NULL&&q!=NULL)
        return false;
    else if(p!=NULL&&q==NULL)
        return false;
    else if(p->left==NULL&&q->left==NULL)
        return true;
    else if(p->left!=NULL&&q->left!=NULL)
        return true;
    else if(p->right==NULL&&q->right==NULL)
        return true;
    else if(p->right!=NULL&&q->right!=NULL)
        return true;
    else 
        return false ;  
 }
bool isSameTree(struct TreeNode* p, struct TreeNode* q){
    if(p==NULL&&q==NULL)
    return true;
    if(CompareChild(p,q))
    {
        if(p->val == q->val)
        {
            return isSameTree(p->left,q->left)&&
         isSameTree(p->right,q->right);
        }
        else 
            return false;
    }
    else
        return false;
     
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43