【leetcode】same-tree

版权声明：噗噗个噗~~~ https://blog.csdn.net/Puyar_/article/details/85285177

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

/**
 * Definition for binary tree
 * 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;
        if(p->val!=q->val||q==NULL||p==NULL)return false;
        else {
           bool flag1=isSameTree(p->left,q->left);
           bool flag2=isSameTree(p->right,q->right);
           if(flag1&&flag2)return true;
           else return false;
        }
    }
};