leetcode【100】Same Tree

问题描述：

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

源码：

剑指offer第二版第27题剑指offer总纲，很类似。一个递归很简单。时间空间都是100%。

/**
 * 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) {
        if(p==NULL && q==NULL)     return true;
        else 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);
    }
};

非递归的方法，也非常的经典：

/**
 * 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 check(TreeNode* p, TreeNode* q){
        if(p==NULL && q==NULL)      return true;
        if(p==NULL || q==NULL)      return false;
        if(p->val != q->val)        return false;
        return true;
    }
    bool isSameTree(TreeNode* p, TreeNode* q) {
        if(p==NULL && q==NULL)     return true;
        if(!check(p, q))    return false;
        queue<TreeNode*> compare_p, compare_q;
        compare_p.push(p);
        compare_q.push(q);
        while(!compare_p.empty()){
            p = compare_p.front();
            q = compare_q.front();
            compare_p.pop();      compare_q.pop();
            if(!check(p, q))    return false;
            if(p != NULL){
                if(!check(p->left, q->left))    return false;
                if(p->left != NULL){
                    compare_p.push(p->left);    compare_q.push(q->left);
                }
                if(!check(p->right, q->right))    return false;
                if(p->right != NULL){
                    compare_p.push(p->right);    compare_q.push(q->right);
                }
            }
        }
        return true;
    }
};