【树】leetcode_100_相同的树

【树】leetcode_100_相同的树

/**
 * 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 == nullptr && q == nullptr) return true;
        if ((p == nullptr && q!= nullptr) ||(p!=nullptr && q==nullptr)) return false;
        if (p->val != q->val)  return false;

        bool ll = isSameTree(p->left,q->left);
        bool rr = isSameTree(p->right, q->right);

        return ll && rr;


    }
};