[LeetCode] 100. Same Tree

Problem:

Given two binary trees, 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:     1         1
          / \       / \
         2   3     2   3

        [1,2,3],   [1,2,3]

Output: true

Example 2:

Input:     1         1
          /           \
         2             2

        [1,2],     [1,null,2]

Output: false

Example 3:

Input:     1         1
          / \       / \
         2   1     1   2

        [1,2,1],   [1,1,2]

Output: false

Solution:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        bool isSame = true; // 默认两棵树是相同的
        dfs(p, q, isSame);  // 深度优先搜索检查每个节点，若出现一处节点不相同，则两棵树判为不相同
        return isSame;
    }
    
    void dfs(TreeNode* p, TreeNode* q, bool& isSame) {
        // 两个节点都不为空，但节点值不相同
        if (p != NULL && q != NULL) {
            if (p->val != q->val) isSame = false;
            dfs(p->left, q->left, isSame);   // 检查左子树
            dfs(p->right, q->right, isSame); // 检查右子树
        }
        // p、q两个节点仅有一个为空，则可判断两棵树一定不相同
        if (p == NULL && q != NULL || p != NULL && q == NULL) isSame = false;
    }
};