leetcode-100-same tree

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 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 true;
            if((p&&!q)||(!p&&q)) return false;
            return (p->val==q->val)&&isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);

        }
};