LeetCode-100. 相同的树

给定两个二叉树，编写一个函数来检验它们是否相同。

如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。

示例 1:

输入:       1         1
          / \       / \
         2   3     2   3

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

输出: true
示例 2:

输入:      1          1
          /           \
         2             2

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

输出: false
示例 3:

输入:       1         1
          / \       / \
         2   1     1   2

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

输出: false

#include <iostream>
using namespace std;

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){
            if(p==q)
                return true;
            else
                return false;
        }
        bool isLeft = false;
        bool isRight = false;
        if(p->val != q->val){
            return false;
        }else{
            isLeft  = isSameTree(p->left,q->left);
            isRight = isSameTree(p->right,q->right);

            if(isLeft && isRight){
                return true;
            }else{
                return false;
            }
        }
    }
};

int main(){
    Solution *ps = new Solution();
    TreeNode *p = new TreeNode(8);
    TreeNode *p1 = new TreeNode(99);
    TreeNode *p2 = new TreeNode(100);
    p->left = p1;
    p1->right = p2;


    TreeNode *q = NULL;
    bool ret = ps->isSameTree(p,q);
    cout<<"ret:"<<ret<<endl;

    return 0;
}

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {

        if (p == NULL && q == NULL) {
            return true;
        }

        if (p == NULL && q != NULL) {
            return false;
        }
        if (p != NULL && q == NULL) {
            return false;
        }

        if (p->val != q->val) {
            return false;
        }

        bool leftVal = isSameTree(p->left, q->left);
        bool rightVal = isSameTree(p->right, q->right);

        return (leftVal && rightVal);
    }
};