100. Same Tree (C语言)

100. Same Tree (C语言)

递归判断两个二叉树相同

题目

Given the roots of two binary trees p and q, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.

Example 1:

Input: p = [1,2,3], q = [1,2,3]
Output: true
Example 2:

Input: p = [1,2], q = [1,null,2]
Output: false
Example 3:

Input: p = [1,2,1], q = [1,1,2]
Output: false

Constraints:
The number of nodes in both trees is in the range [0, 100].
-104 <= Node.val <= 104

解答

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

bool isSame(struct TreeNode* p, struct TreeNode* q)
{
    if(p == NULL && q == NULL)
        return true;
    else if((p == NULL && q != NULL) || (p != NULL && q == NULL))
        return false;
    else
    {
        if(p->val != q->val)
            return false;
    }
    
    if(isSame(p->left, q->left) && isSame(p->right, q->right))
        return true;
    return false;
}
bool isSameTree(struct TreeNode* p, struct TreeNode* q){
    return isSame(p, q);
}

遇到的问题

要关注一个node要做的操作，不要忽略当前node为NULL时的情况。