LeetCode-100. Same Tree-using C++

【题目描述】                           tag:Tree                           difficulty:easy

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

即判断两棵二叉树是否一模一样

【函数形式】

/**
 * 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) {
}

【解题思路】

既然给了两个指针，就保持两个工作指针处在两棵二叉树的相同位置，并判断在相同位置上的二叉树结点是否一样，如果一样或都是空，那么继续往下判断，这样不断的递归最后产生答案。

【代码如下】

class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        if(p == NULL && q == NULL)
            return 1;
        if(p == NULL && q != NULL)
            return 0;
        if(p != NULL && q == NULL)
            return 0;
        if(p->val != q->val)
            return 0;
        
        int i,j;
        
        if(p->left == NULL && q->left == NULL)
            i = 1;
        else if(p->left != NULL && q->left != NULL)
            i = isSameTree(p->left,q->left);
        else
            i = 0;
        
        if(p->right == NULL && q->right == NULL)
            j = 1;
        else if(p->right != NULL && q->right != NULL)
            j = isSameTree(p->right,q->right);
        else
            j = 0;
        
        return i*j;
    }
};