从零开始的LC刷题(21): 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

给出两个二叉树，结构：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

判断两个树是否是全等的。同时DFS中序遍历两个树就行了，递归结果：

Success

Runtime: 0 ms, faster than 100.00% of C++ online submissions for Same Tree.

Memory Usage: 10 MB, less than 57.76% of C++ online submissions for Same Tree.

代码：

class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        if(p==NULL&&q==NULL){return true;}
        if(p==NULL||q==NULL){return false;}
        bool b;
        bool a=isSameTree(p->left,q->left);
        p->val==q->val?b=true:b=false;
        bool c=isSameTree(p->right,q->right);
        if(a==true&&b==true&&c==true){return true;}
        else return false;
    }
};

这样速度还行就是内存表现不行，为了减少内存消耗去掉了几个bool变量，结果如下：

Success

Runtime: 0 ms, faster than 100.00% of C++ online submissions for Same Tree.

Memory Usage: 9.7 MB, less than 81.68% of C++ online submissions for Same Tree.

只能说好了一点，代码：

class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        if(p==NULL&&q==NULL){return true;}
        if(p==NULL||q==NULL){return false;}
        if(isSameTree(p->left,q->left)==true){
            if(p->val==q->val){
                if(isSameTree(p->right,q->right)==true) {return true;}}}
        return false;
    }
};

如果循环而非递归DFS的话可能会好一点（也不一定，毕竟入栈也要内存），就是懒得打代码了。