leetcode + 判断两个二叉树是否相同，递归

点击打开链接

/**
 * 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||!q) return !p&&!q;
    return p->val==q->val&&isSameTree(p->left, q->left)&&isSameTree(p->right,q->right);
    }
};